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 int maxN = 1e6 + 10;
const long long base = 1e9 + 7;
int N, ans;
long long power[maxN], H[maxN];
string S;
vector<int> F;
long long gethash(int x, int y) {
  return (H[y] - H[x - 1] * power[y - x + 1] + base * base) % base;
}
bool check(int x) {
  long long h = gethash(1, x);
  for (int i = 2; i < N - x + 1; i++)
    if (gethash(i, i + x - 1) == h) return 1;
  return 0;
}
int main() {
  cin >> S;
  N = S.size();
  power[0] = 1;
  for (int i = 1; i <= N; i++) {
    power[i] = power[i - 1] * 26 % base;
    H[i] = (H[i - 1] * 26 + S[i - 1] - 'a') % base;
  }
  for (int i = 1; i <= N; i++) {
    long long hpre = gethash(1, i), hsuf = gethash(N - i + 1, N);
    if (hpre == hsuf) F.push_back(i);
  }
  ans = -1;
  int l = 0, r = F.size() - 1;
  while (l <= r) {
    int mid = (l + r) / 2;
    if (check(F[mid]))
      ans = F[mid], l = mid + 1;
    else
      r = mid - 1;
  }
  if (ans < 0) cout << "Just a legend";
  for (int i = 0; i < ans; i++) cout << S[i];
}