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 N = 1e6 + 10;
const int mod = 1e9 + 7;
int nex[N];
char a[N];
bool v[N];
inline int re() {
  int x = 0;
  char c = getchar();
  bool p = 0;
  for (; c < '0' || c > '9'; c = getchar()) p |= c == '-';
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - '0';
  return p ? -x : x;
}
int main() {
  int i, j, k, x, y, n, m;
  scanf("%s", a);
  n = strlen(a);
  for (i = 1, j = 0; i < n; i++) {
    for (; j && a[i] != a[j]; j = nex[j - 1])
      ;
    if (a[i] == a[j]) ++j;
    nex[i] = j;
  }
  if (!nex[n - 1]) return printf("Just a legend"), 0;
  for (i = 1; i < n - 1; i++) v[nex[i]] = 1;
  for (j = nex[n - 1]; j; j = nex[j - 1])
    if (v[j]) {
      for (i = 0; i < j; i++) printf("%c", a[i]);
      return 0;
    }
  printf("Just a legend");
  return 0;
}