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 + 20;
char s[maxn];
int nxt[maxn], cnt[maxn];
void GetNextval(char* p, int nxt[]) {
  int pLen = strlen(p);
  nxt[0] = -1;
  int k = -1;
  int j = 0;
  while (j != pLen) {
    if (k == -1 || p[j] == p[k]) {
      ++j;
      ++k;
      nxt[j] = k;
    } else {
      k = nxt[k];
    }
  }
}
int main() {
  scanf("%s", s);
  GetNextval(s, nxt);
  int l = strlen(s);
  for (int i = 1; i <= l; i++) {
    cnt[nxt[i]]++;
    ;
  }
  if (cnt[nxt[l]] >= 2 && nxt[l] != 0) {
    for (int i = 0; i < nxt[l]; i++) {
      printf("%c", s[i]);
    }
  } else if (nxt[nxt[l]] != 0 && nxt[nxt[l]] != -1) {
    for (int i = 0; i < nxt[nxt[l]]; i++) {
      printf("%c", s[i]);
    }
  } else {
    printf("Just a legend");
  }
  return 0;
}