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;
char T[1000005], s[1000005];
int f[1000005];
void getfail(char *p, int len) {
  int j;
  f[0] = j = -1;
  for (int i = 1; i < len; i++) {
    while (j >= 0 && p[j + 1] != p[i]) j = f[j];
    if (p[j + 1] == p[i]) j++;
    f[i] = j;
  }
}
int find(char *s, int len) {
  int x = strlen(T);
  int j = -1;
  for (int i = 0; i < x; i++) {
    while (j >= 0 && s[j + 1] != T[i]) j = f[j];
    if (s[j + 1] == T[i]) j++;
    if (j + 1 == len) return len;
  }
  return -1;
}
int main() {
  int pp = -1;
  scanf("%s", s);
  if (strlen(s) <= 2)
    printf("Just a legend\n");
  else {
    getfail(s, strlen(s));
    strncpy(T, s + 1, strlen(s) - 2);
    T[strlen(s) - 2] = '\0';
    int j = strlen(s) - 1;
    while (f[j] >= 0) {
      if (f[j] + 1 > pp) {
        int t = find(s, f[j] + 1);
        if (t > pp) pp = t;
      }
      j = f[j];
    }
    if (pp != -1)
      for (int i = 0; i < pp; i++) printf("%c", s[i]);
    else
      printf("Just a legend\n");
  }
  return 0;
}