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>
char str[1000010];
int l;
int nxt[1000010];
int cnt[1000010];
int main() {
  scanf("%s", str);
  l = strlen(str);
  memset(nxt, -1, sizeof(nxt));
  int k;
  for (int i = 1; i < l; i++) {
    for (k = nxt[i - 1]; k >= 0 && str[i] - str[k + 1]; k = nxt[k])
      ;
    if (str[k + 1] == str[i]) {
      nxt[i] = k + 1;
    }
  }
  memset(cnt, 0, sizeof(cnt));
  for (int i = 0; i < l; i++) {
    if (nxt[i] + 1) {
      cnt[nxt[i]]++;
    }
  }
  for (int i = l - 1; i > 0; i--) {
    cnt[i - 1] += cnt[i];
  }
  k = nxt[l - 1];
  while (k + 1) {
    if (cnt[k] > 1) {
      break;
    }
    k = nxt[k];
  }
  if (k == -1) {
    printf("Just a legend\n");
  } else {
    str[k + 1] = 0;
    printf("%s\n", str);
  }
}