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;
long long mod1 = 1e9 + 7;
long long mod2 = 998244353;
long long mul(long long x, long long y) {
  return (1ll * (x % mod1) * (y % mod1));
}
long long power(long long x, long long y) {
  long long z = 1;
  while (y > 0) {
    if (y % 2) z = mul(z, x);
    x = mul(x, x);
    y /= 2;
  }
  return z;
}
long long gcd(long long a, long long b) {
  if (a < b) return gcd(b, a);
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long min(long long a, long long b) {
  if (a < b) return a;
  return b;
}
long long max(long long a, long long b) {
  if (a > b) return a;
  return b;
}
long long pref[(long long)1e7];
string sol(const string& s) {
  string a = s;
  long long c = 0;
  for (int i = 1; i < (int)a.size(); i++) {
    while (c != 0 && a[c] != a[i]) c = pref[c - 1];
    if (a[c] == a[i]) c++;
    pref[i] = c;
  }
  return s.substr(0, c);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  string s;
  cin >> s;
  string t = sol(s);
  long long n = s.size(), m = t.size();
  long long f = 1;
  if (m == 0) {
    cout << "Just a legend" << endl;
  } else {
    for (long long i = 1; i < n - 1; i++) {
      if (pref[i] == m) {
        f = 0;
        cout << t << endl;
        break;
      }
    }
    string st = s.substr(0, pref[m - 1]);
    if (f) {
      if (st.size() == 0 || m == 0) {
        cout << "Just a legend" << endl;
      } else {
        cout << st << endl;
      }
    }
  }
}