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 in[1100000];
unsigned long long hs, st[1100000], ed[1100000];
unsigned long long pw[1100000];
int main() {
  int i, j, k, l, m, n, ok, res;
  while (scanf("%s", in) == 1) {
    n = strlen(in);
    res = 0;
    pw[0] = 1;
    for (i = 0; i < n + 1; i++) pw[i + 1] = pw[i] * 10007;
    st[0] = ed[0] = 0;
    for (i = 0; i < n; i++) st[i + 1] = st[i] * 10007 + in[i];
    for (i = 0; i < n; i++) ed[i + 1] = ed[i] + in[n - 1 - i] * pw[i];
    for (k = n - 1; k; k--)
      if (st[k] == ed[k]) {
        ok = 0;
        hs = 0;
        for (i = 0; i < k; i++) hs = hs * 10007 + in[i];
        for (i = k; i < n - 1; i++) {
          hs = hs * 10007 + in[i] - in[i - k] * pw[k];
          if (hs == st[k]) ok = 1;
        }
        if (ok) {
          res = k;
          break;
        }
      }
    if (res > 0) {
      for (i = 0; i < res; i++) putchar(in[i]);
      puts("");
    } else {
      puts("Just a legend");
    }
  }
  return 0;
}