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>
#pragma GCC optimize(3)
using namespace std;
const int maxn = 1000005;
int nxt[maxn];
char a[maxn], b[maxn];
int main() {
  scanf("%s", a + 1);
  int n = strlen(a + 1);
  int m = n;
  for (register int i = 1; i <= n; i++) {
    b[i] = a[i];
  }
  for (register int i = 2, j; i <= n; i++) {
    j = nxt[i - 1];
    while (j && a[i] != a[j + 1]) {
      j = nxt[j];
    }
    if (a[i] == a[j + 1]) {
      j++;
    }
    nxt[i] = j;
  }
  if (!nxt[n]) {
    printf("Just a legend");
    return 0;
  }
  while (1) {
    n = nxt[n];
    if (n == 0) {
      break;
    }
    for (int i = nxt[n]; i <= m - 1; i++) {
      if (nxt[i] == n) {
        for (register int k = 1; k <= n; k++) {
          printf("%c", b[k]);
        }
        return 0;
      }
    }
  }
  printf("Just a legend");
  return 0;
}