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;
set<long long int> pref;
long long phash[1000002], n;
vector<long long int> vv;
long long expo(long long base, long long exponent, long long mod) {
  long long ans = 1;
  while (exponent != 0) {
    if ((exponent & 1) == 1) {
      ans = ans * base;
      ans = ans % mod;
    }
    base = base * base;
    base %= mod;
    exponent >>= 1;
  }
  return ans % mod;
}
bool check(long long m) {
  long long len = vv[m];
  for (long long i = 1; i + len - 1 < n - 1; i++) {
    if ((phash[i + len - 1] -
         (phash[i - 1] * expo(97, len, 1000000007)) % 1000000007 + 1000000007) %
            1000000007 ==
        phash[len - 1])
      return 1;
  }
  return 0;
}
int main() {
  long long i, j;
  string s;
  cin >> s;
  n = (long long)s.length();
  long long hash = 0;
  for (i = 0; i < n; i++) {
    hash = ((hash * 97) % 1000000007 + (s[i] - 'a' + 1)) % 1000000007;
    phash[i] = hash;
    if (i < n - 1) {
    }
  }
  for (i = 1; i < n; i++) {
    hash = (phash[n - 1] -
            (phash[i - 1] * expo(97, n - i, 1000000007)) % 1000000007 +
            1000000007) %
           1000000007;
    if (hash == phash[n - i - 1]) {
      vv.push_back(n - i);
    }
  }
  sort((vv).begin(), (vv).end());
  long long lo = 0, hi = (long long)(vv.size()) - 1LL, mid;
  while (lo < hi) {
    mid = lo + (hi - lo + 1) / 2;
    if (check(mid))
      lo = mid;
    else
      hi = mid - 1;
  }
  if (lo >= 0 and lo < (long long)(vv.size()) and check(lo))
    cout << s.substr(0, vv[lo]);
  else
    cout << "Just a legend";
  return 0;
}