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;
char S[1000001];
int Z[1000001], m;
int R[1000001], nr;
int st, dr, mij, okay;
void calculZ(int m, char S[], int Z[]) {
  int L, R, k, kp, beta;
  Z[1] = 0;
  L = R = 1;
  for (k = 2; k <= m; k++)
    if (S[k] != S[1])
      Z[k] = 0;
    else if (k > R) {
      Z[k] = 1;
      while (S[k + Z[k]] == S[1 + Z[k]]) Z[k]++;
      L = k;
      R = k + Z[k] - 1;
    } else {
      kp = k - (L - 1);
      beta = R - (k - 1);
      Z[k] = min(Z[kp], beta);
      while (S[k + Z[k]] == S[1 + Z[k]]) Z[k]++;
      if (k + Z[k] - 1 > R) {
        L = k;
        R = k + Z[k] - 1;
      }
    }
}
int main() {
  cin >> S + 1;
  m = strlen(S + 1);
  calculZ(m, S, Z);
  nr = 0;
  for (int k = m; k >= 2; k--)
    if (Z[k] == m - (k - 1)) R[++nr] = Z[k];
  if (nr == 0) {
    cout << "Just a legend";
    return 0;
  }
  st = 1;
  dr = nr;
  while (st < dr) {
    mij = (st + dr + 1) / 2;
    okay = 0;
    for (int i = 2; i <= m - R[mij]; i++)
      if (Z[i] >= R[mij]) {
        okay = 1;
        break;
      }
    if (okay == 1)
      st = mij;
    else
      dr = mij - 1;
  }
  okay = 0;
  for (int i = 2; i <= m - R[st]; i++)
    if (Z[i] >= R[st]) {
      okay = 1;
      break;
    }
  if (okay == 1)
    for (int i = 1; i <= R[st]; i++) cout << S[i];
  else
    cout << "Just a legend";
  return 0;
}