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 s[maxn];
unsigned long long pre[maxn], base[maxn];
int d, flag = 1;
bool check(int x) {
  unsigned long long hash1 = pre[x], hash2 = pre[d] - pre[d - x] * base[x];
  if (hash1 != hash2) {
    return 0;
  }
  for (int i = 2; i + x - 1 <= d - 1; i++) {
    unsigned long long hash3 = pre[i + x - 1] - pre[i - 1] * base[x];
    if (hash1 == hash3) {
      return 1;
    }
  }
  return 0;
}
int main() {
  scanf("%s", s + 1);
  d = strlen(s + 1);
  base[0] = 1;
  for (int i = 1; i <= d; i++) {
    pre[i] = pre[i - 1] * 29 + s[i] - 'a' + 1;
    base[i] = base[i - 1] * 29;
  }
  int ans = -1;
  for (int i = d; i >= 1; i--) {
    if (check(i)) {
      ans = i;
      break;
    }
  }
  if (ans == -1) {
    printf("Just a legend\n");
  } else {
    for (int i = 1; i <= ans; i++) {
      printf("%c", s[i]);
    }
    printf("\n");
  }
  return 0;
}