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 N = 1000007;
int phi[2][N];
void calc_phi(int id, string& s) {
  phi[id][0] = phi[id][1] = 0;
  for (int i = 2; i <= (int)s.size(); i++) {
    int x = phi[id][i - 1];
    while (x != 0 and s[x] != s[i - 1]) {
      x = phi[id][x];
    }
    if (s[x] == s[i - 1])
      phi[id][i] = x + 1;
    else
      phi[id][i] = 0;
  }
}
int main() {
  string s;
  cin >> s;
  string t = s;
  reverse(t.begin(), t.end());
  calc_phi(0, s);
  calc_phi(1, t);
  int best = 0, p = -1;
  for (int i = 1, j = s.size(); i <= s.size(); ++i, --j) {
    if (phi[0][i] == phi[1][j + phi[0][i] - 1] and phi[0][i] > best) {
      best = phi[0][i];
      p = i - phi[0][i];
    }
  }
  if (best)
    cout << s.substr(p, best) << endl;
  else
    cout << "Just a legend\n";
}