Problem: Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obelix had no luck opening them.

A little later they found a string s, carved on a rock below the temple's gates. Asterix supposed that that's the password that opens the temple and read the string aloud. However, nothing happened. Then Asterix supposed that a password is some substring t of the string s.

Prefix supposed that the substring t is the beginning of the string s; Suffix supposed that the substring t should be the end of the string s; and Obelix supposed that t should be located somewhere inside the string s, that is, t is neither its beginning, nor its end.

Asterix chose the substring t so as to please all his companions. Besides, from all acceptable variants Asterix chose the longest one (as Asterix loves long strings). When Asterix read the substring t aloud, the temple doors opened. 

You know the string s. Find the substring t or determine that such substring does not exist and all that's been written above is just a nice legend.

Input

You are given the string s whose length can vary from 1 to 106 (inclusive), consisting of small Latin letters.

Output

Print the string t. If a suitable t string does not exist, then print "Just a legend" without the quotes.

Examples

Input

fixprefixsuffix


Output

fix

Input

abcdabc


Output

Just a legend

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  cin >> s;
  int n = s.size(), p;
  vector<int> pre(n, -1);
  for (int i = 1; i < n; i++) {
    p = i - 1;
    while (s[pre[p] + 1] != s[i]) {
      if (pre[p] == -1) {
        break;
      }
      p = pre[p];
    }
    if (s[pre[p] + 1] == s[i]) {
      pre[i] = pre[p] + 1;
    } else {
      pre[i] = -1;
    }
  }
  set<int> T;
  int i = pre[n - 1];
  while (i != -1) {
    T.insert(i + 1);
    i = pre[i];
  }
  int x = -1;
  for (int i = 1; i < n - 1; i++) {
    if (T.find(pre[i] + 1) != T.end()) {
      if (pre[i] + 1 > x) x = pre[i] + 1;
    }
  }
  if (x == -1)
    cout << "Just a legend\n";
  else {
    for (int i = 0; i < x; i++) {
      cout << s[i];
    }
    cout << endl;
  }
  return 0;
}