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 mod = 1000099999, b = 313, h, n, l, q;
string s;
vector<int> pref(1000001), power(1000001), d;
void precalc(const string &s) {
  pref[0] = 0;
  power[0] = 1;
  for (int i = 0; i < s.size(); i++) {
    pref[i + 1] = ((long long)pref[i] * b + s[i] - 'a' + 1) % mod;
    power[i + 1] = ((long long)power[i] * b) % mod;
  }
}
int hash_(int i, int j) {
  return (mod + pref[j] - ((long long)pref[i] * power[j - i]) % mod) % mod;
}
bool f(int x) {
  h = hash_(0, x);
  int k = 0;
  for (int i = 1; i < s.size() - x + 1; i++)
    if (h == hash_(i, i + x)) k++;
  return k > 1;
}
int main() {
  cin >> s;
  precalc(s);
  n = s.size();
  d.push_back(0);
  for (int i = 1; i < s.size() - 1; i++) {
    if (hash_(0, i) == hash_(n - i, n)) d.push_back(i);
  }
  int l = 0, r = d.size() - 1, m;
  while (l < r) {
    m = (l + r + 1) / 2;
    if (f(d[m]))
      l = m;
    else
      r = m - 1;
  }
  if (d[l] > 0) {
    cout << s.substr(0, d[l]);
    return 0;
  }
  cout << "Just a legend";
  return 0;
}