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 NMax = 1000010;
int N;
char A[NMax];
int pi[NMax];
bool viz[NMax];
void Make_Pi() {
  int k = 0;
  pi[1] = 0;
  for (int i = 2; i <= N; ++i) {
    while (k > 0 && A[k + 1] != A[i]) k = pi[k];
    if (A[k + 1] == A[i]) ++k;
    pi[i] = k;
    if (i < N) viz[pi[i]] = true;
  }
}
int main() {
  std::ios_base::sync_with_stdio(false);
  cin >> (A + 1);
  N = strlen(A + 1);
  Make_Pi();
  bool found = false;
  int p = pi[N];
  int ans;
  while (!found && p > 0)
    if (viz[p]) {
      found = true;
      ans = p;
    } else
      p = pi[p];
  if (found) {
    A[p + 1] = 0;
    cout << (A + 1) << "\n";
    return 0;
  }
  cout << "Just a legend\n";
  return 0;
}