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;
using ull = unsigned long long;
const int maxn = 1e6 + 10;
const ull p = 701, mod = 1e9 + 7;
string s;
int n;
ull h[maxn], po[maxn];
vector<int> v;
bool check(int x) {
  for (int i = x; i < n - 1; i++)
    if ((h[x - 1] * po[i - x + 1] % mod) == ((mod + h[i] - h[i - x]) % mod))
      return true;
  return false;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> s;
  n = s.size();
  po[0] = 1;
  for (int i = 1; i < maxn; i++) po[i] = (po[i - 1] * p) % mod;
  h[0] = s[0] - 'a' + 1;
  for (int i = 1; i < n; i++)
    h[i] = (h[i - 1] + (((s[i] - 'a' + 1) * po[i]) % mod)) % mod;
  for (int i = 1; i < n; i++)
    if ((h[i - 1] * po[n - i] % mod) == ((mod + h[n - 1] - h[n - i - 1]) % mod))
      v.push_back(i);
  if (v.empty() || !check(v[0])) {
    cout << "Just a legend\n";
    return 0;
  }
  int l = 0, r = v.size();
  while (l + 1 < r) {
    int mid = (l + r) / 2;
    if (check(v[mid]))
      l = mid;
    else
      r = mid;
  }
  for (int i = 0; i < v[l]; i++) cout << s[i];
  cout << "\n";
  return 0;
}