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;
vector<int> z_func(const string &s) {
  vector<int> z(s.size());
  int l = 0, r = 0;
  for (int _n(s.size()), k(1); k < _n; k++) {
    if (k <= r) z[k] = min(z[k - l], r - k + 1);
    while (k + z[k] < s.size() && s[k + z[k]] == s[z[k]]) ++z[k];
    if (k + z[k] - 1 > r) l = k, r = k + z[k] - 1;
  }
  return z;
}
int main() {
  string s;
  cin >> s;
  const int N = s.size();
  if (N <= 2) {
    cout << "Just a legend" << endl;
    return 0;
  }
  {
    set<char> ch((s).begin(), (s).end());
    if (ch.size() == 1) {
      cout << s.substr(0, N - 2) << endl;
      ;
      return 0;
    }
  }
  vector<int> z = z_func(s);
  int mx = 0;
  for (int _n(N), i(1); i < _n; i++) mx = max(mx, min(z[i], N - 1 - i));
  int ans = -1;
  for (int _n(N), i(N - mx); i < _n; i++)
    if (i + z[i] == N) {
      ans = z[i];
      break;
    }
  if (ans == -1) {
    cout << "Just a legend" << endl;
    return 0;
  }
  cout << s.substr(0, ans) << endl;
  return 0;
}