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 int INF = 1e18;
const int inf = 1e9;
const int MOD = 1e9 + 7;
const int nax = 1000000 + 10;
int fail[nax];
int main() {
  std::ios::sync_with_stdio(0);
  string s;
  cin >> s;
  int len = s.length();
  fail[0] = 0;
  int i = 1, j = 0;
  while (i < len) {
    if (s[j] != s[i]) {
      if (j == 0)
        fail[i] = 0, i++;
      else
        j = fail[j - 1];
    } else {
      fail[i] = j + 1;
      i++, j++;
    }
  }
  int last = fail[len - 1];
  int slast = fail[last - 1];
  int flag = 0;
  if (last == 0) flag = 1;
  int mainflag = 0;
  for (int i = 0; i < len - 1; i++) {
    if (fail[i] == last) mainflag = 1;
  }
  if (mainflag == 1 && flag == 0) {
    cout << s.substr(0, last) << endl;
    return 0;
  }
  if (slast == 0) flag = 1;
  mainflag = 1;
  if (mainflag == 1 && flag == 0) {
    cout << s.substr(0, slast) << endl;
    return 0;
  }
  cout << "Just a legend";
  return 0;
}