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 z[(int)1e6 + 3];
string z_algo(string s) {
  int x = 0, y = 0;
  int T = 0, M = (int)1e6 + 3;
  for (int i = 1; i < s.size(); i++) {
    z[i] = max(0, min(z[i - x], y - i + 1));
    while (i + z[i] < s.size() && s[z[i]] == s[i + z[i]]) {
      x = i, y = i + z[i];
      z[i]++;
    }
  }
  int maxz = 0, res = 0, n = s.size();
  int ans = 0;
  for (int i = 0; i < n; i++) {
    if (i + z[i] == n && maxz >= z[i]) {
      ans = max(ans, z[i]);
    }
    maxz = max(maxz, z[i]);
  }
  string t;
  for (int i = 0; i < ans; i++) t.push_back(s[i]);
  if (!ans) return "Just a legend";
  return t;
}
int main() {
  int t, tc = 0;
  string s, ans;
  cin >> s;
  ans = z_algo(s);
  cout << ans << endl;
  return 0;
}