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() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  int n = s.length();
  const long long p = 31LL;
  long long p_pow[n];
  p_pow[0] = 1;
  for (int i = 1; i < n; ++i) p_pow[i] = p_pow[i - 1] * p;
  long long h[n];
  h[0] = (s[0] - 'a' + 1LL) * p_pow[0];
  for (int i = 1; i < n; ++i) h[i] = h[i - 1] + (s[i] - 'a' + 1LL) * p_pow[i];
  for (int i = n - 1; i > 0; --i) {
    long long h1 = h[i - 1] * p_pow[n - 1];
    long long h2 = (h[n - 1] - h[n - 1 - i]) * p_pow[i - 1];
    if (h1 != h2) continue;
    for (int j = 1; j <= n - 1 - i; ++j) {
      long long h3 = (h[j + i - 1] - h[j - 1]) * p_pow[n - j - 1];
      if (h1 == h3) {
        string s1 = s.substr(0, i), s2 = s.substr(n - i), s3 = s.substr(j, i);
        if (s1 == s2 && s2 == s3) {
          cout << s1 << '\n';
          return 0;
        }
      }
    }
  }
  cout << "Just a legend\n";
}