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 = 982451653;
const long long P = 1e9 + 7;
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  string str;
  cin >> str;
  long long a = 0, b = 0, n = str.size();
  long long curP = 1;
  vector<pair<long long, long long>> w;
  for (long long i = 0; i < n - 2; ++i) {
    a += curP * str[i];
    curP *= P;
    curP %= MOD;
    a %= MOD;
    b = b * P + str[n - 1 - i];
    b %= MOD;
    if (a == b) {
      w.push_back(make_pair(i + 1, b));
    }
  }
  long long start = -1, end = w.size();
  for (long long i = 0; i < 25; ++i) {
    long long cur = (start + end) / 2;
    if (cur >= w.size()) {
      end = cur;
      continue;
    }
    long long hash = 0;
    long long pow = 1;
    long long j;
    for (j = n - 1 - w[cur].first; j < n - 1; ++j) {
      hash += (str[j] * pow) % MOD;
      hash %= MOD;
      if (j == n - 2) {
        break;
      }
      pow *= P;
      pow %= MOD;
    }
    if (hash == w[cur].second) {
      start = cur;
      continue;
    }
    for (j = n - 2 - w[cur].first; j > 0; j--) {
      hash =
          (hash + MOD * str[j + w[cur].first] - pow * str[j + w[cur].first]) %
          MOD;
      hash = (hash * P + str[j]) % MOD;
      if (hash == w[cur].second) {
        start = cur;
        break;
      }
    }
    if (start == cur) {
      continue;
    }
    end = cur;
  }
  if (start == -1) {
    cout << "Just a legend";
  } else {
    cout << str.substr(0, w[start].first);
  }
}