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 maxn = 1e6;
long long int partial_hash[maxn];
long long int base = 37;
vector<int> v;
long long int P[maxn];
string s;
long long int H(int s, int e) {
  if (s == 0) return partial_hash[e];
  s--;
  return partial_hash[e] - partial_hash[s] * P[e - s];
}
bool ism(long long int hsh, int sz) {
  for (int i = 1; i + sz < s.size(); i++)
    if (H(i, i + sz - 1) == hsh) return true;
  return false;
}
int main() {
  cin >> s;
  partial_hash[0] = s[0] - 'a' + 1;
  for (int i = 1; i < s.size(); i++)
    partial_hash[i] = base * partial_hash[i - 1] + s[i] - 'a' + 1;
  P[0] = 1;
  for (int i = 1; i < s.size(); i++) P[i] = P[i - 1] * base;
  for (int i = 1; i < s.size() - 1; i++)
    if (H(0, i - 1) == H(s.size() - i, s.size() - 1)) v.push_back(i);
  if (v.size() == 0 or !ism(H(0, v[0] - 1), v[0])) {
    cout << "Just a legend" << endl;
    return 0;
  }
  int lo = 0, hi = v.size();
  while (hi - lo > 1) {
    int mid = (lo + hi) / 2;
    if (ism(H(0, v[mid] - 1), v[mid]))
      lo = mid;
    else
      hi = mid;
  }
  cout << s.substr(0, v[lo]) << endl;
  return 0;
}