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 long long MAX_N = 1e6 + 10, mod = 2e9 + 63, base1 = 1e9 + 21,
                base2 = 1e9 + 181;
char s[MAX_N];
long long pw1[MAX_N], pw2[MAX_N], slen;
void pw_calc() {
  pw1[0] = pw2[0] = 1;
  for (int i = 1; i < MAX_N; i++) {
    pw1[i] = (pw1[i - 1] * base1) % mod;
    pw2[i] = (pw2[i - 1] * base2) % mod;
  }
}
struct Hash {
  long long h1[MAX_N], h2[MAX_N];
  void init() {
    h1[0] = h2[0] = 0;
    for (int i = 1; i <= slen; i++) {
      h1[i] = (h1[i - 1] * base1 + s[i]) % mod;
      h2[i] = (h2[i - 1] * base2 + s[i]) % mod;
    }
  }
  inline long long hashVal(int l, int r) {
    long long hsh1 = (h1[r] - h1[l - 1] * pw1[r - l + 1]) % mod;
    if (hsh1 < 0) hsh1 += mod;
    long long hsh2 = (h2[r] - h2[l - 1] * pw2[r - l + 1]) % mod;
    if (hsh2 < 0) hsh2 += mod;
    return (hsh1 << 32) | hsh2;
  }
} fw;
long long subPre;
inline long long preExist(long long &l, long long &r) {
  long long pre = fw.hashVal(1, r - l + 1), hsh = fw.hashVal(l, r);
  return pre == hsh;
}
int main() {
  scanf("%s", s + 1);
  slen = strlen(s + 1);
  pw_calc();
  fw.init();
  for (long long i = 2; i < slen; i++) {
    long long lo = i, hi = slen - 1;
    while (lo <= hi) {
      long long mid = (lo + hi) >> 1;
      if (preExist(i, mid)) {
        subPre = max(subPre, mid - i + 1);
        lo = mid + 1;
      } else
        hi = mid - 1;
    }
  }
  long long start = -1;
  for (long long i = 1; i <= slen; ++i) {
    long long len = slen - i + 1;
    if (len > subPre) continue;
    long long pre = fw.hashVal(1, len), suf = fw.hashVal(i, slen);
    if (pre == suf) {
      start = i;
      break;
    }
  }
  if (start == -1)
    printf("Just a legend");
  else
    for (long long i = start; i <= slen; i++) printf("%c", s[i]);
  printf("\n");
  return 0;
}