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 GCD(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
int Z[1000003];
void zAlgorithm(char *S, int n) {
  int g = 0, f = 0;
  Z[0] = 0;
  for (int i = 1; i < n; i++)
    if (i < g && Z[i - f] != (g - i))
      Z[i] = min(Z[i - f], g - i);
    else {
      g = max(g, f = i);
      while (g < n && S[g] == S[g - f]) g++;
      Z[i] = g - f;
    }
}
int main() {
  char cad[1000003];
  scanf("%s", cad);
  int n = strlen(cad);
  zAlgorithm(cad, n);
  int may = 0, sol = 0;
  for (int i = 0; i < n; i++) {
    if (i + Z[i] == n && Z[i] > sol && may >= Z[i]) sol = Z[i];
    if (may < Z[i]) may = Z[i];
  }
  if (sol == 0)
    printf("Just a legend\n");
  else {
    cad[sol] = '\0';
    printf("%s\n", cad);
  }
  return 0;
}