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;
int T[1000010];
void preprocess(const string &Needle) {
  T[0] = -1;
  int i = 0, j = -1;
  while (i < Needle.size()) {
    while (j >= 0 && Needle[i] != Needle[j]) j = T[j];
    j++;
    i++;
    T[i] = j;
  }
}
int F[1000010];
void Find(const string &Hay, const string &Needle) {
  preprocess(Needle);
  int i = 0, j = 0;
  while (i < Hay.size()) {
    while (j >= 0 && Needle[j] != Hay[i]) j = T[j];
    i++, j++;
  }
  while (j >= 0) {
    F[i - j] = j;
    j = T[j];
  }
}
int ok(const string &Hay, const string &Needle) {
  preprocess(Needle);
  int i = 1, j = 0;
  int ma = 0;
  while (i < Hay.size()) {
    while (j >= 0 && Needle[j] != Hay[i]) j = T[j];
    i++, j++;
    if (i == Hay.size()) break;
    ma = max(j, ma);
  }
  return ma;
}
int main() {
  string A = "fixprefixsuffix";
  cin >> A;
  Find(A, A);
  int ma = ok(A, A);
  int ans = 0;
  for (int i = 0; i < A.size() && ans == 0; ++i)
    if (F[i] <= ma) ans = F[i];
  if (ans == 0)
    cout << "Just a legend" << endl;
  else
    cout << A.substr(0, ans) << endl;
}