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;
const int maxN = 1000 * 1000 + 10, mod = 1000 * 1000 * 1000 + 7;
string s;
int i, n, k, p[maxN], ans, m;
long long h1, h2, st;
int main() {
  cin >> s;
  n = s.length();
  if (n < 3) {
    cout << "Just a legend" << endl;
    return 0;
  }
  p[0] = 0;
  for (i = 1; i < n; ++i) {
    k = p[i - 1];
    while (k > 0 && s[i] != s[k]) k = p[k - 1];
    if (s[i] == s[k]) ++k;
    p[i] = k;
  }
  m = 0;
  for (i = 1; i < n - 1; ++i) m = max(m, p[i]);
  ans = 0;
  h1 = h2 = 0;
  st = 1;
  for (i = n - 1; i >= n - m; --i) {
    h1 = (h1 * 101 + s[n - i - 1]) % mod;
    h2 = (h2 + s[i] * st) % mod;
    st = (st * 101) % mod;
    if (h1 == h2) ans = n - i;
  }
  if (ans == 0) {
    cout << "Just a legend" << endl;
  } else {
    for (i = 0; i < ans; ++i) cout << s[i];
    cout << endl;
  }
  return 0;
}