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 N = 1e6 + 7;
const int mod = 1e9 + 7;
char second[N];
int n, ans;
int mx[21][N];
int lg[N];
int get(int l, int r) {
  int z = lg[r - l + 1];
  return max(mx[z][l], mx[z][r - (1 << z) + 1]);
}
void solve() {
  scanf("\n%s", second);
  n = strlen(second);
  vector<int> z(n, 0);
  for (int j = 0, i = 1; i < n; ++i) {
    if (z[j] + j > i) z[i] = min(z[i - j], z[j] + j - i);
    while (z[i] + i < n && second[z[i]] == second[z[i] + i]) z[i]++;
    if (z[i] + i > z[j] + j) j = i;
  }
  z[0] = n;
  for (int i = 1; i <= n; ++i)
    mx[0][i] = z[i - 1], lg[i] = i > 1 ? lg[i >> 1] + 1 : 0;
  for (int k = 1; k <= lg[n]; ++k)
    for (int i = 1; i + (1 << k) - 1 <= n; ++i)
      mx[k][i] = max(mx[k - 1][i], mx[k - 1][i + (1 << (k - 1))]);
  ans = -1;
  for (int i = 1, l, r; i <= n; ++i) {
    l = 2, r = n - i;
    if (r + i - l < i) break;
    if (get(l, r) >= i && z[n - i] == i) ans = i;
  }
  if (ans == -1) {
    printf("Just a legend\n");
    return;
  }
  for (int i = 0; i < ans; ++i) printf("%c", second[i]);
}
int main() {
  int T = 1;
  while (T--) solve();
  return 0;
}