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 double eps = 1e-6;
const int N = 1000010;
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
int nxt[2][N];
void preKMP(char x[], int m, int kmpNext[]) {
  int i = 1, j = kmpNext[1] = 0;
  while (i <= m) {
    while (0 != j && x[i + 1] != x[j + 1]) j = kmpNext[j];
    if (x[j + 1] == x[i + 1]) ++j;
    kmpNext[i + 1] = j;
    ++i;
  }
}
int main() {
  char s[N] = {0};
  scanf("%s", s + 1);
  int len = strlen(s + 1);
  preKMP(s, len, nxt[0]);
  reverse(s + 1, s + 1 + len);
  preKMP(s, len, nxt[1]);
  reverse(s + 1, s + 1 + len);
  int pos = 0, mx = 0;
  for (int i = 1; i <= len; i++)
    if (nxt[0][i] == nxt[1][len - i + nxt[0][i]])
      if (nxt[0][i] > mx) pos = i, mx = nxt[0][i];
  if (pos == 0) {
    cout << "Just a legend" << endl;
  } else {
    for (int i = pos - mx + 1; i <= pos; i++) {
      printf("%c", s[i]);
    }
    puts("");
  }
  return 0;
}