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;
string kmp(string s) {
  long long int l = 0, i = 1, n = s.length(), c = 0;
  long long int lps[n];
  string ans;
  lps[0] = 0;
  while (i < n) {
    if (s[i] == s[l]) {
      l++;
      lps[i] = l;
      i++;
    } else {
      if (l == 0) {
        lps[i] = l;
        i++;
      } else
        l = lps[l - 1];
    }
  }
  for (i = 1; i < (n - 1); i++) c = max(c, lps[i]);
  i = n;
  while (i > 0 && lps[i - 1] > c) i = lps[i - 1];
  c = min(c, lps[i - 1]);
  if (c <= 0)
    ans = "Just a legend";
  else
    ans = s.substr(0, c);
  return ans;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long int t = 1;
  while (t--) {
    string s;
    cin >> s;
    s = kmp(s);
    cout << s << "\n";
  }
  return 0;
}