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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<long long> longest_substring_ending_at_index_also_a_prefix(string s) {
  long long n = s.size();
  vector<long long> prefix(n, 0);
  for (long long i = 1; i < n; i++) {
    long long j = prefix[i - 1];
    while (s[i] != s[j] && j > 0) {
      j = prefix[j - 1];
    }
    if (s[i] == s[j]) j++;
    prefix[i] = j;
  }
  return (prefix);
}
int32_t main() {
  string s;
  cin >> s;
  long long n = s.size();
  vector<long long> prefix = longest_substring_ending_at_index_also_a_prefix(s);
  if (prefix[n - 1] == 0) {
    cout << "Just a legend";
    goto last;
  } else {
    for (long long i = 1; i <= n - 2; i++) {
      if (prefix[i] == prefix[n - 1]) {
        cout << s.substr(0, prefix[n - 1]);
        goto last;
      }
    }
    if (prefix[prefix[n - 1] - 1]) {
      cout << s.substr(0, prefix[prefix[n - 1] - 1]);
      goto last;
    } else {
      cout << "Just a legend";
      goto last;
    }
  }
last:;
}