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>
const long long ary = 1e6 + 5;
const long long mod = 1e9 + 7;
const long long inf = 1e18;
using namespace std;
string second;
long long z[ary], c[ary], mx;
void zf() {
  long long l = 1, r = 1;
  for (int i = 1; i < (long long)second.size(); i++) {
    z[i] = max(0ll, min(z[i - l], r - i + 1));
    c[z[i]]++;
    while (i + z[i] < (long long)second.size() &&
           second[z[i]] == second[i + z[i]]) {
      z[i]++;
      c[z[i]]++;
    }
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> second;
  zf();
  for (int i = 0; i < (long long)second.size(); i++) {
    if (i + z[i] == (long long)second.size()) {
      if (c[z[i]] > 1) {
        for (int j = i; j < i + z[i]; j++) {
          cout << second[j];
        }
        return 0;
      }
    }
  }
  cout << "Just a legend";
}