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 n, i, j, ans = 0;
string s;
long long lps[10000000];
void computelps(string s) {
  long long len = 0;
  lps[0] = 0;
  int i = 1;
  long long M = s.length();
  while (i < M) {
    if (s[i] == s[len])
      len++, lps[i] = len, i++;
    else {
      if (len != 0)
        len = lps[len - 1];
      else
        lps[i] = 0, i++;
    }
  }
}
bool kmp(string txt, string pat) {
  int i = 0;
  int j = 0;
  while (i < txt.length()) {
    if (pat[j] == txt[i]) {
      j++;
      i++;
    }
    if (j == pat.length()) return true;
    if (i < txt.length() && pat[j] != txt[i]) {
      if (j != 0)
        j = lps[j - 1];
      else
        i = i + 1;
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> s;
  string str = "Just a legend";
  computelps(s);
  n = s.length();
  if (n < 3) return cout << str, 0;
  string t = s;
  t.pop_back();
  t = t.substr(1);
  if (lps[n - 1] == 0 or s.length() <= 2) return cout << str, 0;
  for (long long k = lps[n - 1]; k > 0; k = lps[k - 1])
    if (kmp(t, s.substr(0, k))) return cout << s.substr(0, k), 0;
  cout << str;
}