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;
char s[1000009];
unsigned long long st[1000009], d[1000009];
int n;
unsigned long long H(int l, int r) {
  l--;
  return st[r] - st[l] * d[r - l];
}
bool Check(int k) {
  for (int i = 2; i + k - 1 < n; i++)
    if (H(1, k) == H(i, i + k - 1)) return 1;
  return 0;
}
int main() {
  cin >> s + 1;
  s[0] = ' ';
  n = strlen(s) - 1;
  d[0] = 1;
  for (int i = 1; i <= (n); i++) d[i] = d[i - 1] * 13331;
  st[0] = 0;
  for (int i = 1; i <= (n); i++) st[i] = st[i - 1] * 13331 + s[i];
  for (int i = n - 1; i >= 1; i--) {
    if (H(1, i) == H(n - i + 1, n)) {
      if (Check(i)) {
        for (int j = 1; j <= (i); j++) cout << s[j];
        return 0;
      }
    }
  }
  puts("Just a legend");
  return 0;
}