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;
const long long mod = 1e9 + 7;
string a;
bool match(long long st) {
  string pat = a.substr(0, st + 1);
  string str = a.substr(1, a.length() - 2);
  long long n = str.length(), m = pat.length();
  if (n < m) return false;
  long long lps[n];
  lps[0] = 0;
  long long i = 1, len = 0;
  while (i < m) {
    if (pat[i] == pat[len])
      lps[i++] = ++len;
    else {
      if (len != 0)
        len = lps[len - 1];
      else
        lps[i++] = 0;
    }
  }
  i = 0;
  long long j = 0;
  while (i < n) {
    if (str[i] == pat[j]) i++, j++;
    if (j == m) {
      return true;
    } else if (i < n and str[i] != pat[j]) {
      if (j != 0)
        j = lps[j - 1];
      else
        i++;
    }
  }
  return false;
}
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> a;
  long long n = a.length();
  long long mul1 = 1, fhash = 0, shash = 0;
  long long p = 37;
  vector<pair<long long, long long> > commons;
  for (long long len = 1; len < n; len++) {
    long long x = len - 1, y = n - len;
    fhash = (fhash + (a[x] - 'a' + 1) * mul1 % mod) % mod;
    mul1 = (mul1 * p) % mod;
    shash = (shash * p) % mod;
    shash = (shash + (a[y] - 'a' + 1)) % mod;
    if (fhash == shash) {
      commons.push_back({x, y});
    }
  }
  bool legend = false;
  if (commons.empty()) legend = true;
  if (legend) {
    cout << "Just a legend" << endl;
    return 0;
  }
  if (!match(commons[0].first)) legend = true;
  if (legend) {
    cout << "Just a legend" << endl;
    return 0;
  }
  long long lo = 0, hi = commons.size() - 1, mid = -1;
  while (lo <= hi) {
    if (mid == (lo + hi) / 2) break;
    mid = (lo + hi) / 2;
    long long x = commons[mid].first, y = commons[mid].second;
    if (match(x))
      lo = mid;
    else
      hi = mid;
  }
  if (lo > hi) swap(lo, hi);
  pair<long long, long long> ans;
  if (match(commons[hi].first))
    ans = commons[hi];
  else
    ans = commons[lo];
  for (long long i = 0; i <= ans.first; i++) cout << a[i];
  cout << endl;
}