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;
long long fastPow(long long a, long long b) {
  long long ret = 1;
  while (b) {
    if (b & 1) ret = (ret * a) % 1000000007;
    a = (a * a) % 1000000007;
    b >>= 1;
  }
  return ret;
}
void printT(int n, string str) {
  for (int i = int(0); i < int(n); i++) cout << str[i];
  cout << endl;
}
int main() {
  string str;
  cin >> str;
  if (str.length() < 3) {
    cout << "Just a legend" << endl;
    return 0;
  }
  long long c;
  vector<long long> t(str.length());
  t[0] = c = 0;
  for (int i = int(1); i < int(str.length()); i++) {
    while (c && str[c] != str[i]) c = t[c - 1];
    c += str[c] == str[i] ? 1 : 0;
    t[i] = c;
  }
  if (!t.back()) {
    cout << "Just a legend" << endl;
    return 0;
  }
  for (int i = int(0); i < int(str.length() - 1); i++) {
    if (t[i] == t.back()) {
      printT(t.back(), str);
      return 0;
    }
  }
  if (t[t.back() - 1] > 0) {
    printT(t[t.back() - 1], str);
    return 0;
  }
  cout << "Just a legend" << endl;
  return 0;
}