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 + 10;
const int INF = 0x3f3f3f3f;
void read(int &val) {
  int x = 0;
  int bz = 1;
  char c;
  for (c = getchar(); (c < '0' || c > '9') && c != '-'; c = getchar())
    ;
  if (c == '-') {
    bz = -1;
    c = getchar();
  }
  for (; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + c - 48;
  val = x * bz;
}
void getnxt(char *ptr, int len, int *nxt) {
  int i, j;
  j = nxt[0] = -1;
  i = 0;
  while (i < len) {
    while (-1 != j && ptr[i] != ptr[j]) j = nxt[j];
    nxt[++i] = ++j;
  }
}
int KMP_Count(char ptr[], int plen, char str[], int slen, int nxt[]) {
  int i, j;
  int ans = 0;
  getnxt(ptr, plen, nxt);
  i = j = 0;
  while (i < slen) {
    while (-1 != j && str[i] != ptr[j]) j = nxt[j];
    i++;
    j++;
    if (j >= plen) {
      ans++;
      j = nxt[j];
    }
  }
  return ans;
}
char str[maxn], ptr[maxn];
int nxt[maxn];
int vis[maxn];
int main() {
  scanf("%s", ptr);
  int len = strlen(ptr);
  getnxt(ptr, len, nxt);
  int ans1 = nxt[len], ans2 = 0, ans = 0;
  ans = ans1;
  while (ans1 > 0) {
    vis[ans1] = 1;
    ans1 = nxt[ans1];
  }
  for (int i = 2; i <= len - 1; i++) {
    if (ptr[i - 1] == ptr[len - 1] && vis[nxt[i]]) ans2 = max(nxt[i], ans2);
  }
  ans = min(ans2, ans);
  if (ans == 0) {
    printf("Just a legend\n");
  } else {
    for (int i = 0; i <= ans - 1; i++) {
      printf("%c", ptr[i]);
    }
    printf("\n");
  }
  return 0;
}