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 MAXN = 1000010;
int nex[MAXN], len_pattern, pos, flag;
string pattern;
set<int> s;
void get_next() {
  int i = 0, j = -1;
  nex[0] = -1;
  while (i < len_pattern) {
    if (-1 == j || pattern[i] == pattern[j]) {
      i++;
      j++;
      nex[i] = j;
    } else
      j = nex[j];
  }
}
int main() {
  cin >> pattern, len_pattern = (int)pattern.size();
  get_next();
  int len = len_pattern;
  for (int i = 1; i < len_pattern; i++) s.insert(nex[i]);
  while (0 != nex[len] && -1 != nex[len]) {
    if (s.count(nex[len])) {
      for (int i = 0; i < nex[len]; i++) cout << pattern[i];
      cout << endl;
      flag = 1;
      break;
    }
    len = nex[len];
  }
  if (!flag) cout << "Just a legend" << endl;
  return 0;
}