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 long long MOD = 1e9 + 7;
const long long B = 727;
const long long MAXn = 1e6 + 100;
string s;
long long n, hsh[MAXn], pw[MAXn];
vector<long long> v;
long long hs(long long l, long long r) {
  if (l == 0) return hsh[r];
  return (hsh[r] - ((hsh[l - 1] * pw[r - l + 1]) % MOD) + MOD) % MOD;
}
bool is_ok(long long x) {
  if (hs(0, x) != hs(n - x - 1, n - 1)) return 0;
  for (long long i = x + 1; i < n - 1; ++i)
    if (hs(0, x) == hs(i - x, i)) return 1;
  return 0;
}
long long bs(long long l, long long r) {
  if (l == r) return r;
  long long mid = (l + r + 1) / 2;
  if (is_ok(v[mid]))
    bs(mid, r);
  else
    bs(l, mid - 1);
}
signed main() {
  cin >> s;
  n = (long long)s.size();
  pw[0] = 1;
  for (long long i = 1; i < MAXn; ++i) {
    pw[i] = (pw[i - 1] * B) % MOD;
  }
  hsh[0] = s[0];
  for (long long i = 1; i < n; ++i) {
    hsh[i] = ((hsh[i - 1] * B) % MOD + (s[i])) % MOD;
  }
  for (long long i = 0; i < n - 1; ++i)
    if (hs(0, i) == hs(n - i - 1, n - 1)) v.push_back(i);
  if ((long long)v.size() == 0) {
    return cout << "Just a legend\n", 0;
  }
  long long nn = (long long)v.size();
  long long point = bs(0, nn - 1);
  if (is_ok(v[point])) {
    for (long long i = 0; i <= v[point]; ++i) cout << s[i];
    cout << endl;
  } else {
    return cout << "Just a legend\n", 0;
  }
  return 0;
}