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 s[1000005];
int z[1000005];
int main() {
  gets(s);
  int ln = strlen(s);
  int j, l = 0, r = 0, b, st;
  for (int i = 1; i < ln; i++) {
    if (i <= r) {
      st = i - l;
      b = r - i + 1;
      if (z[st] < b) {
        z[i] = z[st];
      } else {
        for (j = 1; j < ln && s[r + j] == s[r - i + j]; j++)
          ;
        z[i] = r - i + j;
        l = i;
        r = r + j - 1;
      }
    } else {
      for (j = 0; i + j < ln && s[i + j] == s[j]; j++)
        ;
      l = i;
      r = i + j - 1;
      z[i] = j;
    }
  }
  int res = 0, mx = 0;
  for (int i = ln - 2; i >= 1; i--) {
    st = ln - i - 1;
    mx = max(mx, z[st]);
    if (z[ln - i] == i && mx >= i) {
      res = i;
      break;
    }
  }
  if (res == 0)
    printf("Just a legend\n");
  else
    for (j = 0; j < res; j++) printf("%c", s[j]);
  printf("\n");
  return 0;
}