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());
string s;
vector<long long int> zval;
long long int n;
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  n = s.length();
  zval.resize(n, 0);
  long long int L = 0, R = 0;
  for (long long int i = 1; i < n; i++) {
    if (i > R) {
      L = R = i;
      while (R < n && s[R - L] == s[R]) R++;
      zval[i] = R - L;
      R--;
    } else {
      long long int k = i - L;
      if (zval[k] < R - i + 1)
        zval[i] = zval[k];
      else {
        L = i;
        while (R < n && s[R - L] == s[R]) R++;
        zval[i] = R - L;
        R--;
      }
    }
  }
  vector<long long int> maxi;
  maxi.resize(n, 0);
  for (long long int i = 1; i < n; i++) {
    maxi[i] = max(maxi[i - 1], zval[i]);
  }
  long long int suff = -1;
  for (long long int i = (n - 1); i >= 1; i--) {
    if ((zval[i] + i) == n && maxi[i - 1] >= zval[i]) {
      suff = i;
    }
  }
  if (suff == -1) {
    cout << "Just a legend"
         << "\n";
    return 0;
  }
  long long int len = n - suff;
  long long int pre = -1;
  for (long long int i = 1; i < suff; i++) {
    if (zval[i] >= len) {
      pre = i;
      break;
    }
  }
  if (pre == -1) {
    cout << "Just a legend"
         << "\n";
    return 0;
  }
  for (long long int i = 0; i < len; i++) {
    cout << s[i];
  }
  cout << "\n";
  return 0;
}