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;
long long sqr(long long x) { return x * x; }
void computeLPSArray(string pat, int M, int* lps);
int lastmatchJ = -1;
int KMPSearch(string pat, string txt, int flag) {
  int M = pat.size();
  int N = txt.size();
  int lps[M];
  computeLPSArray(pat, M, lps);
  int i = 0;
  int j = 0;
  int endd = -1, lastmatchI = 0;
  while (i < N) {
    if (pat[j] == txt[i]) {
      endd = max(endd, j);
      lastmatchI = i + 1;
      lastmatchJ = j + 1;
      j++;
      i++;
    } else if (i < N && pat[j] != txt[i]) {
      if (j != 0)
        j = lps[j - 1];
      else
        i = i + 1;
    }
  }
  if (flag == 0)
    return endd + 1;
  else {
    if (lastmatchI == N) return 1;
    return 0;
  }
}
void computeLPSArray(string pat, int M, int* lps) {
  int len = 0;
  lps[0] = 0;
  int i = 1;
  while (i < M) {
    if (pat[i] == pat[len]) {
      len++;
      lps[i] = len;
      i++;
    } else {
      if (len != 0) {
        len = lps[len - 1];
      } else {
        lps[i] = 0;
        i++;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  string s1, s2;
  cin >> s1;
  long long x = s1.size();
  s2 = s1.substr(1, x - 2);
  int k = KMPSearch(s1, s2, 0);
  if (k == 0) {
    cout << "Just a legend";
    return 0;
  }
  string s3 = s1.substr(0, k);
  string s4 = s1.substr(x - k, k);
  if (KMPSearch(s3, s4, 1)) {
    cout << s1.substr(0, lastmatchJ);
  } else {
    cout << "Just a legend";
    return 0;
  }
}