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;
int read() {
  register int x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = 10 * x + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void write(int x) {
  if (x > 9) write(x / 10);
  putchar(x % 10 + '0');
}
const int Size = 1000005;
const int INF = 0x3f3f3f3f;
char str[Size], t[Size];
int n, nxt[Size];
int main() {
  scanf("%s", str + 1);
  n = strlen(str + 1);
  int j = 0;
  int maxn = 0;
  for (register int i = 2; i <= n; i++) {
    while (j > 0 && str[j + 1] != str[i]) j = nxt[j];
    if (str[j + 1] == str[i]) j++;
    nxt[i] = j;
    if (i < n) maxn = max(maxn, nxt[i]);
  }
  int x = nxt[n];
  while (x > maxn) x = nxt[x];
  if (!x) {
    puts("Just a legend");
    return 0;
  }
  for (register int i = 2; i < n; i++) {
    if (nxt[i] == x) {
      for (register int j = 1; j <= nxt[i]; j++) {
        putchar(str[j]);
      }
      return 0;
    }
  }
  return 0;
}