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;
string s;
long long H1, H2, h[1000005], H;
vector<pair<long long, int> > v;
int i, j, n, k;
int main() {
  h[0] = 1;
  for (i = 1; i < 1000000; i++) h[i] = h[i - 1] * 31;
  cin >> s;
  n = s.size();
  H1 = (long long)(s[0] - 'a') + 1;
  H2 = (long long)(s[n - 1] - 'a') + 1;
  if (H1 == H2) v.push_back(make_pair(H1, 0));
  for (i = 1; i < n - 1; i++) {
    H1 *= 31;
    H1 += (long long)(s[i] - 'a') + 1;
    H2 += (long long)(s[n - 1 - i] - 'a' + 1) * h[i];
    if (H1 == H2) v.push_back(make_pair(H1, i));
  }
  reverse(v.begin(), v.end());
  for (j = 0; j < v.size(); j++) {
    H1 = v[j].first;
    H = 0;
    for (i = 0; i <= v[j].second; i++)
      H *= 31, H += (long long)(s[i] - 'a') + 1;
    for (i = v[j].second + 1; i < n; i++) {
      H -= (long long)(s[i - v[j].second - 1] - 'a' + 1) * h[v[j].second];
      H *= 31;
      H += (long long)(s[i] - 'a') + 1;
      if (H == H1 && i != n - 1) {
        for (k = 0; k <= v[j].second; k++) cout << s[k];
        cout << endl;
        return 0;
      }
    }
  }
  cout << "Just a legend" << endl;
}