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;
string s;
int p[MaxN], deg[MaxN], H[MaxN], x = 31, Sum;
void v() {
  deg[0] = 1;
  for (int i = 1; i <= s.size(); i++) deg[i] = deg[i - 1] * x;
  H[0] = 0;
  H[1] = s[0];
  for (int i = 2; i <= s.size(); i++) H[i] = H[i - 1] * x + s[i - 1];
}
int Find(int L, int R) { return H[R] - H[L - 1] * deg[R - L + 1]; }
int main() {
  cin >> s;
  v();
  for (int i = 1; i < s.size(); i++) {
    int k = p[i - 1];
    while (s[i] != s[k] && k > 0) k = p[k - 1];
    if (s[i] == s[k]) k++;
    p[i] = k;
    if (k > Sum && i != s.size() - 1)
      if (Find(1, k) == Find(s.size() - k + 1, s.size())) Sum = k;
  }
  if (Sum > 0)
    cout << s.substr(0, Sum), exit(0);
  else
    printf("Just a legend");
  return 0;
}