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;
void getLPS(string s, int lps[]) {
  int n = s.length();
  for (int i = 1; i < n; i++) {
    int indToConsider = i - 1;
    while (true) {
      indToConsider = lps[indToConsider];
      if (s[i] == s[indToConsider]) {
        lps[i] = indToConsider + 1;
        break;
      }
      if (indToConsider == 0) break;
      indToConsider--;
    }
  }
}
int Zfunc(string s, string pat) {
  string newStr = pat + "$" + s;
  int n = newStr.size();
  int zfunc[n];
  memset(zfunc, 0, sizeof(zfunc));
  zfunc[0] = n;
  int l = -1;
  int r = -1;
  int ind = 0;
  for (int i = 1; i < n; i++) {
    if (l == -1) {
      if (newStr[i] == newStr[0]) {
        l = i;
        r = i;
        for (int j = i + 1; j < n; j++) {
          if (newStr[j] == newStr[j - i]) {
            r = j;
          } else {
            break;
          }
        }
        zfunc[i] = r - l + 1;
      }
    } else {
      if (i > r) {
        l = -1;
        r = -1;
        i--;
      } else {
        int k = i - l;
        if (zfunc[k] >= r - i + 1) {
          int j = r + 1;
          while (r < n && newStr[j] == newStr[j - i]) {
            r++;
            j++;
          }
          l = i;
          zfunc[i] = r - l + 1;
        } else {
          zfunc[i] = zfunc[k];
        }
      }
    }
  }
  int mx = 0;
  for (int i = 1; i < n; i++) {
    mx = max(mx, zfunc[i]);
  }
  return mx;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int n = s.size();
  int lps[n];
  memset(lps, 0, sizeof(lps));
  getLPS(s, lps);
  int pref = lps[n - 1];
  if (pref == 0) {
    cout << "Just a legend";
    return 0;
  }
  string prefStr = "";
  for (int i = 0; i < pref; i++) {
    prefStr += s[i];
  }
  string substr = "";
  for (int i = 1; i < n - 1; i++) {
    substr += s[i];
  }
  int mx = Zfunc(substr, prefStr);
  if (mx == 0) {
    cout << "Just a legend";
    return 0;
  }
  int yes = 1;
  while (pref > mx) {
    pref = lps[pref - 1];
  }
  if (pref == 0) {
    cout << "Just a legend";
    return 0;
  }
  for (int i = 0; i < pref; i++) {
    cout << s[i];
  }
  return 0;
}