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;
void preFun(string str, vector<long long int>& pi) {
  pi[0] = 0;
  for (long long int i = 1; i < str.size() - 1; ++i) {
    long long int j = pi[i - 1];
    while (j > 0 && str[j] != str[i]) j = pi[j - 1];
    if (str[j] == str[i]) j++;
    pi[i] = j;
  }
}
int main() {
  string str;
  cin >> str;
  if (str.size() == 1) {
    cout << "Just a legend";
    return 0;
  }
  vector<long long int> pi(str.size());
  preFun(str, pi);
  long long int maxi = INT_MIN;
  for (long long int i = 0; i < str.size() - 1; ++i) {
    if (maxi < pi[i]) maxi = pi[i];
  }
  long long int ans = -1;
  long long int j = pi[str.size() - 2];
  while ((str[str.size() - 1] != str[j]) || (j + 1 > maxi)) {
    if (j <= 0) break;
    j = pi[j - 1];
  }
  if (str[j] == str[str.size() - 1]) j++;
  ans = j;
  if (ans == 0 || ans == -1 || ans > maxi) {
    cout << "Just a legend";
  } else
    cout << str.substr(0, ans);
  return 0;
}