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 len;
int p[1000006];
char str[1000006];
bool record[1000006];
void calulate_kmp_prefix() {
  p[1] = 0;
  int k = 0;
  for (int i = 2; i <= len; i++) {
    while (k > 0 && str[i] != str[k + 1]) {
      k = p[k];
    }
    if (str[i] == str[k + 1]) {
      k++;
    }
    p[i] = k;
    if (i < len) {
      record[k] = true;
    }
  }
}
int solve() {
  int k = p[len];
  while (k) {
    if (record[k] == true) {
      return k;
    }
    k = p[k];
  }
  return 0;
}
int main() {
  scanf("%s", str + 1);
  len = strlen(str + 1);
  calulate_kmp_prefix();
  int res = solve();
  if (res == 0) {
    puts("Just a legend");
    return 0;
  }
  for (int i = 1; i <= res; i++) {
    printf("%c", str[i]);
  }
  printf("\n");
  return 0;
}