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 inf = 1000000000000000000LL;
const double EPS = 1e-9;
const long long mod = 1000000007ll;
const int maxn = 500500;
int longestP[1000500];
char pat[1000500];
void KMP() {
  for (int i = 1, k = 0; pat[i]; i++) {
    while (k > 0 && pat[i] != pat[k]) k = longestP[k - 1];
    if (pat[i] == pat[k])
      longestP[i] = ++k;
    else
      longestP[i] = k;
  }
}
int main() {
  scanf("%s", pat);
  int n = strlen(pat);
  KMP();
  if (longestP[n - 1] == 0) {
    puts("Just a legend");
    return 0;
  }
  for (int i = 0; i + 1 < n; i++)
    if (longestP[n - 1] == longestP[i]) {
      for (int j = 0; j < longestP[i]; j++) putchar(pat[j]);
      return 0;
    }
  if (longestP[longestP[n - 1] - 1] == 0) {
    puts("Just a legend");
    return 0;
  }
  for (int j = 0; j < longestP[longestP[n - 1] - 1]; j++) putchar(pat[j]);
}