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>
#pragma comment(linker, "/STACK:1000000000,1000000000")
using namespace std;
const long long inf = 1e18 + 7;
const long long mod = 1e9 + 7;
const double eps = 1e-9;
const double PI = 2 * acos(0.0);
const double E = 2.71828;
char s[1000005];
long long p[1000005];
int main(void) {
  gets(s);
  long long n = strlen(s), k = 0;
  for (long long i = 1; i < n; i++) {
    while (k && s[i] != s[k]) k = p[k - 1];
    if (s[i] == s[k]) k++;
    p[i] = k;
  }
  long long ans = p[n - 1];
  bool ok = 0;
  if (!ans) {
    puts("Just a legend");
    exit(0);
  }
  for (long long(i) = 0; (i) < (long long)(n - 1); (i)++)
    if (p[i] == ans) ok = 1;
  if (!ok) ans = p[ans - 1];
  if (ans <= 0) {
    puts("Just a legend");
    exit(0);
  }
  for (long long i = 0; i < ans; i++) {
    putchar(s[i]);
  }
  printf("\n");
  return 0;
}