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;
const int MAXN = 1e6;
const long long z = 131, MOD = 1e9 + 21;
long long Z[MAXN + 1];
void fillZ() {
  Z[0] = 1;
  for (int n = 1; n <= MAXN; ++n) Z[n] = z * Z[n - 1] % MOD;
}
struct RollingHashing {
  vector<long long> H;
  RollingHashing(string &S) {
    int N = S.length();
    H.resize(N + 1);
    H[N] = 0;
    for (int i = N - 1; i >= 0; --i) H[i] = (S[i] + z * H[i + 1]) % MOD;
  }
  long long hash(int i, int k) {
    long long ans = (H[i] - Z[k] * H[i + k]) % MOD;
    return ans >= 0 ? ans : ans + MOD;
  }
};
int main() {
  fillZ();
  string s;
  cin >> s;
  int lens = s.length();
  int lent = lens - 2;
  RollingHashing rs(s);
  long long prefix, suffix, mid;
  int i;
  while (lent > 0) {
    prefix = rs.hash(0, lent);
    suffix = rs.hash(lens - lent, lent);
    if (prefix == suffix) {
      i = 1;
      while (i + lent < lens) {
        mid = rs.hash(i, lent);
        if (mid == prefix) {
          for (int j = 0; j < lent; ++j) {
            cout << s[j];
          }
          cout << '\n';
          return 0;
        }
        ++i;
      }
    }
    --lent;
  }
  cout << "Just a legend\n";
  return 0;
}