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 int M = 3e6 + 5;
int a[M], n, nxt[M], len;
char s[M], sb[M];
void Next() {
  int j = 0;
  for (int i = 2; i <= len; i++) {
    while (j && s[j + 1] != s[i]) j = nxt[j];
    if (s[j + 1] == s[i]) j++;
    nxt[i] = j;
  }
}
int main() {
  scanf("%s", s + 1);
  len = strlen(s + 1);
  Next();
  int k = nxt[len];
  if (k == 0) {
    printf("Just a legend\n");
    return 0;
  }
  for (int i = k + 1; i < len; i++) {
    if (nxt[i] >= k) {
      for (int j = 1; j <= k; j++) {
        printf("%c", s[j]);
      }
      return 0;
    }
  }
  if (k == 0 || nxt[k] == 0) {
    printf("Just a legend\n");
    return 0;
  } else {
    for (int j = 1; j <= nxt[k]; j++) {
      printf("%c", s[j]);
    }
  }
  return 0;
}