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 + 7;
const int rr = 2333;
const int mod = 999998639;
long long pre[maxn], poww[maxn];
char str[maxn];
string s, s1, s2, ans = "";
long long hashp(long long l, long long r) {
  return (pre[r] - pre[l - 1] * poww[r - l + 1] % mod + mod) % mod;
}
int main() {
  long long len, fl = 0;
  scanf("%s", str + 1);
  len = strlen(str + 1);
  pre[0] = 0, poww[0] = 1;
  for (int i = 1; i <= len; i++) poww[i] = poww[i - 1] * rr % mod;
  for (int i = 1; i <= len; i++)
    pre[i] = (pre[i - 1] * rr + (str[i] - 'a' + 1)) % mod;
  for (int l = len; l >= 1; l--) {
    if (hashp(1, 1 + l - 1) != hashp(len - l + 1, len)) continue;
    for (int i = 2; i + l - 1 < len; i++) {
      if (hashp(1, 1 + l - 1) == hashp(i, i + l - 1)) {
        fl = 1;
        for (int j = 1; j <= l; j++) ans += str[j];
        break;
      }
    }
    if (fl) break;
  }
  if (ans.size() == 0)
    printf("Just a legend\n");
  else
    cout << ans << endl;
}