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 MAX = 1e6 + 100;
int Z[MAX], F[MAX], SZ;
string Str;
void ZArray() {
  int L, R, K;
  L = 0, R = 0, K = 0;
  for (int i = 1; i < SZ; i++) {
    if (i > R) {
      L = R = i;
      while (Str[R] == Str[R - L]) R++;
      Z[i] = R - L;
      R--;
    } else {
      K = i - L;
      if (Z[K] < R - i + 1)
        Z[i] = Z[K];
      else {
        L = i;
        while (Str[R] == Str[R - L]) R++;
        Z[i] = R - L;
        R--;
      }
    }
  }
}
int main() {
  cin >> Str;
  SZ = Str.size();
  ZArray();
  int pos_min = 0;
  for (int i = 0; i < SZ; i++) {
    if (Z[i] > 0) F[Z[i]]++, pos_min = max(pos_min, Z[i]);
  }
  int sz = 0;
  string tt, ans;
  for (int i = SZ - 1; i >= 1; i--) {
    if (Z[i] + i == SZ && ((F[Z[i]] > 1) || (pos_min > Z[i]))) {
      if (Z[i] > sz) {
        sz = Z[i];
      }
    }
  }
  if (!sz)
    cout << "Just a legend";
  else
    cout << Str.substr(0, sz);
  return 0;
}