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;
void Z_algorithm(string& s, vector<int>& Z) {
  Z.assign(s.length(), -1);
  int L = 0, R = 0, n = s.length();
  for (int i = 1; i < n; ++i) {
    if (i > R) {
      L = R = i;
      while (R < n && s[R - L] == s[R]) R++;
      Z[i] = R - L;
      R--;
    } else if (Z[i - L] >= R - i + 1) {
      L = i;
      while (R < n && s[R - L] == s[R]) R++;
      Z[i] = R - L;
      R--;
    } else
      Z[i] = Z[i - L];
  }
  Z[0] = n;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  string str;
  cin >> str;
  vector<int> Z;
  Z_algorithm(str, Z);
  int z_max = 0, l = 0, n = str.length();
  for (int i = 1; i < n; ++i) {
    if (Z[i] == n - i && z_max >= n - i) {
      l = n - i;
      break;
    }
    z_max = max(z_max, Z[i]);
  }
  if (l == 0)
    cout << "Just a legend" << endl;
  else
    for (int i = 0; i < l; ++i) cout << str[i];
  return 0;
}