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;
int LPS[1000005], visit[1000005];
string S;
int main() {
  int N, i, j, k;
  cin >> S;
  i = 1, j = 0;
  while (i < S.size()) {
    if (S[j] == S[i]) {
      j++;
      LPS[i] = j;
      i++;
    } else {
      if (j != 0)
        j = LPS[j - 1];
      else {
        LPS[i] = 0;
        i++;
      }
    }
  }
  j = S.size() - 1;
  while (j != 0 && LPS[j] > 0) {
    visit[LPS[j]] = 1;
    j = LPS[j - 1];
  }
  int maxx = 0;
  for (i = 1; i < S.size() - 1; i++) {
    if (visit[LPS[i]]) {
      if (maxx < LPS[i]) maxx = LPS[i];
    }
  }
  if (maxx == 0)
    cout << "Just a legend\n";
  else {
    for (i = 0; i < maxx; i++) cout << S[i];
    cout << "\n";
  }
  return 0;
}