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;
long long z[1000002], suf[1000002];
signed main() {
  long long t = 1;
  while (t--) {
    string second;
    cin >> second;
    long long i, n = second.size();
    long long l = 0, r = 0;
    for (i = 1; i < n; i++) {
      if (i <= r) z[i] = min(z[i - l], r - i + 1);
      while (i + z[i] < n and second[z[i]] == second[i + z[i]]) z[i]++;
      if (r < i + z[i] - 1) l = i, r = i + z[i] - 1;
    }
    long long mx = 0;
    for (i = 1; i < n; i++) {
      if (i + z[i] == n) {
        suf[z[i]] = 1;
        mx = max(mx, z[i] - 1);
      } else
        mx = max(mx, z[i]);
    }
    for (i = n - 2; i >= 1; i--) {
      if (suf[i] and i <= mx) {
        cout << second.substr(0, i);
        return 0;
      }
    }
    cout << "Just a legend";
  }
  return 0;
}