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 maxN = 1e6 + 5;
char a[maxN];
int len, nex[maxN];
set<int> st;
void cal_next() {
  nex[0] = nex[1] = 0;
  int k = 0;
  for (int i = 2; i <= len; i++) {
    while (k > 0 && a[k + 1] != a[i]) k = nex[k];
    if (a[k + 1] == a[i]) k++;
    nex[i] = k;
  }
}
int main() {
  while (scanf("%s", a + 1) != EOF) {
    getchar();
    len = (int)strlen(a + 1);
    cal_next();
    st.clear();
    int tmp = nex[len];
    for (int i = 1; i < len; i++) st.insert(nex[i]);
    bool flag = false;
    while (tmp > 0) {
      if (st.count(tmp)) {
        flag = true;
        for (int i = 1; i <= tmp; i++) printf("%c", a[i]);
        printf("\n");
        break;
      }
      tmp = nex[tmp];
    }
    if (!flag) printf("Just a legend\n");
  }
  return 0;
}