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;
string s;
long long int p = 31, flag;
long long int hash_prefix[1000001];
long long int pw[1000000];
const long long int MOD = 1e9 + 9;
long long int pf, ppf, sf, tf, best = -1;
int main() {
  cin >> s;
  pw[0] = 1;
  for (int i = 1; i < 1000000; i++) {
    pw[i] = (pw[i - 1] % MOD * p) % MOD;
  }
  for (int i = 0; s[i]; i++) {
    hash_prefix[i] = ((s[i] - 'a' + 1) * pw[i]) % MOD;
  }
  for (int i = 1; s[i]; i++) {
    hash_prefix[i] += hash_prefix[i - 1];
    hash_prefix[i] %= MOD;
  }
  for (int ln = s.length() - 1; ln > 0; ln--) {
    pf = hash_prefix[ln - 1];
    ppf = (pf * pw[s.length() - ln]) % MOD;
    sf = hash_prefix[s.length() - 1] - hash_prefix[s.length() - ln - 1];
    if (sf < 0) sf += MOD;
    if (sf == ppf) {
      flag = 0;
      for (int i = 1; i + ln - 1 < s.length() - 1; i++) {
        tf = hash_prefix[i + ln - 1] - hash_prefix[i - 1];
        if (tf < 0) tf += MOD;
        ppf = (pf * pw[i]) % MOD;
        if (ppf == tf) flag = 1;
      }
      if (flag) {
        best = ln;
        break;
      }
    }
  }
  if (best == -1) {
    cout << "Just a legend" << '\n';
  } else {
    for (int i = 0; i < best; i++) cout << s[i];
  }
  return 0;
}