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;
using namespace std::chrono;
long long int p = 31, mod = 1e9 + 9, n, ans = -1;
vector<long long int> power(1e6 + 1, 1), prefix(1e6 + 1, 0), nums;
bool check(long long int i) {
  long long int hash1 = prefix[i];
  long long int hash2 = (prefix[n - 1] - prefix[n - 2 - i] + mod) % mod;
  hash1 = (hash1 * power[n - 1]) % mod;
  hash2 = (hash2 * power[i]) % mod;
  return hash1 == hash2;
}
bool check2(long long int mid) {
  long long int len = nums[mid];
  long long int hash1 = (prefix[len - 1] * power[n - 1]) % mod, hash2;
  for (int i = 1; i + len - 1 < n - 1; i++) {
    hash2 = (prefix[i + len - 1] - prefix[i - 1] + mod) % mod;
    hash2 = (hash2 * power[n - 1 - i]) % mod;
    if (hash2 == hash1) {
      ans = max(ans, len);
      return 1;
    }
  }
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  n = s.size();
  for (int i = 1; i <= n; i++) power[i] = (power[i - 1] * p) % mod;
  if (n <= 2) {
    cout << "Just a legend";
    return 0;
  }
  prefix[0] = s[0] - 'a' + 1;
  for (int i = 1; i < n; i++) {
    prefix[i] = (prefix[i - 1] + power[i] * (s[i] - 'a' + 1)) % mod;
  }
  for (int i = 0; i <= n - 3; i++) {
    if (check(i) == 1) nums.push_back(i + 1);
  }
  if (nums.size() == 0) {
    cout << "Just a legend";
    return 0;
  }
  long long int l = 0, r = nums.size() - 1, mid;
  ans = -1;
  while (l <= r) {
    mid = (l + r) / 2;
    if (check2(mid))
      l = mid + 1;
    else
      r = mid - 1;
  }
  if (ans != -1)
    cout << s.substr(0, ans);
  else
    cout << "Just a legend";
  return 0;
}