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;
using ll = long long;
int Z[1000100];
void Z_Algo(string ch) {
  memset(Z, 0, sizeof Z);
  int pos, st, endd;
  int l = ch.size();
  Z[0] = l;
  for (pos = 1, st = 0, endd = 0; pos < l; pos++) {
    if (pos <= endd) Z[pos] = min(endd - pos + 1, Z[pos - st]);
    while (pos + Z[pos] < l && ch[Z[pos]] == ch[pos + Z[pos]]) ++Z[pos];
    if (pos + Z[pos] - 1 > endd) st = pos, endd = pos + Z[pos] - 1;
  }
}
int ara[1000100];
int main() {
  string ch;
  cin >> ch;
  int l = ch.size();
  Z_Algo(ch);
  memset(ara, 0, sizeof(ara));
  int mx = 0;
  for (int i = 1; i < l; i++) ara[Z[i]]++, mx = max(mx, Z[i]);
  for (int i = mx - 1; i >= 0; i--) ara[i] += ara[i + 1];
  int x = -1;
  for (int i = 1; i < l; i++) {
    if (Z[i] == l - i && ara[Z[i]] > 1 && Z[i] < l - 1) {
      x = Z[i];
      break;
    }
  }
  if (x == -1)
    printf("Just a legend\n");
  else {
    for (int i = 0; i < x; i++) cout << ch[i];
    printf("\n");
  }
  return 0;
}