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;
int a, b, c, i, j, k, h, z[1000009], l, r, len, maxlen;
string s;
int main() {
  cin >> s;
  len = s.length();
  l = r = -1;
  for (i = 1; i < len; i++) {
    if (i > r) {
      l = r = i;
      while (r < len && s[r] == s[r - l]) {
        r++;
      }
      r--;
      z[i] = r - l + 1;
    } else {
      if (r - i + 1 > z[i - l]) {
        z[i] = z[i - l];
      } else {
        l = i;
        while (r < len && s[r] == s[r - l]) {
          r++;
        }
        r--;
        z[i] = r - l + 1;
      }
    }
  }
  for (i = 0; i < len; i++) {
    if (z[i] + i < len) {
      maxlen = max(maxlen, z[i]);
    } else {
      maxlen = max(maxlen, z[i] - 1);
    }
  }
  int ans = 0;
  for (i = 1; i < len; i++) {
    if (z[i] + i == len) {
      if (maxlen >= z[i]) {
        ans = z[i];
        break;
      }
    }
  }
  if (ans != 0) {
    for (i = 0; i < ans; i++) {
      cout << s[i];
    }
  } else {
    cout << "Just a legend";
  }
  cout << endl;
  return 0;
}