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 long long p = 1000000000007LL;
char buf[1000010];
long long hsh[1000010], pw[1000010];
long long gthsh(int l, int r) { return hsh[r] - hsh[l - 1] * pw[r - l + 1]; }
int main() {
  scanf("%s", buf);
  int n = strlen(buf);
  pw[0] = 1LL;
  for (int i = 0; i < n; i++) {
    pw[i + 1] = pw[i] * p;
    hsh[i + 1] = hsh[i] * p + buf[i];
  }
  for (int i = n - 1; i >= 0; i--) {
    if (gthsh(1, i + 1) != gthsh(n - i, n)) continue;
    long long t = gthsh(1, i + 1);
    for (int j = 2; j + i < n; j++) {
      if (gthsh(j, j + i) == t) {
        for (int k = 0; k <= i; k++) {
          printf("%c", buf[k]);
        }
        return 0;
      }
    }
  }
  printf("Just a legend");
  return 0;
}