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;
vector<long long> z_function(string &s) {
  long long n = s.length();
  vector<long long> z(n);
  long long l = 0;
  long long r = 0;
  for (long long i = 1; i < n; i++) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) z[i]++;
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
long long n, len = 0;
long long BIT[1000005];
vector<long long> z;
void upd(long long idx, long long val) {
  if (idx == 0) return;
  while (idx <= n) {
    BIT[idx] += val;
    idx += (idx & -idx);
  }
}
long long pref(long long idx) {
  long long sum = 0;
  while (idx > 0) {
    sum += BIT[idx];
    idx -= (idx & -idx);
  }
  return sum;
}
int32_t main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string s;
  cin >> s;
  n = s.length();
  z = z_function(s);
  for (long long i = 0; i < n; i++) {
    upd(z[i], 1);
  }
  for (long long i = n - 1; i > 1; i--) {
    if (z[i] != (n - i)) continue;
    if (pref(n) - pref(z[i] - 1) >= 2) len = max(len, z[i]);
    upd(z[i], -1);
  }
  if (!len)
    cout << "Just a legend";
  else {
    cout << s.substr(0, len);
  }
  return 0;
}