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 main() {
  string s;
  cin >> s;
  int n = (int)s.size();
  long long st[n];
  st[0] = 1;
  for (int i = 1; i < n; ++i) {
    st[i] = st[i - 1] * 31;
  }
  long long h[n];
  for (int i = 0; i < n; ++i) {
    h[i] = (s[i] - 'a' + 1) * st[i];
    if (i) h[i] += h[i - 1];
  }
  int ans = -1;
  for (int i = n - 3; i >= 0; --i) {
    long long ph, sh;
    ph = h[i];
    sh = h[n - 1] - h[n - i - 2];
    sh *= st[i];
    ph *= st[n - 1];
    if (sh == ph) {
      for (int j = 1; j < n - i - 1; ++j) {
        long long mh = h[j + i];
        mh -= h[j - 1];
        mh *= st[n - j - 1];
        if (mh == ph) {
          ans = i;
          cout << s.substr(0, ans + 1);
          return 0;
        }
      }
    }
  }
  if (ans == -1)
    cout << "Just a legend";
  else
    cout << s.substr(0, ans + 1);
  return 0;
}