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 MAX_N = 1000005;
int main() {
  char s[MAX_N];
  scanf("%s", s);
  int n = strlen(s);
  vector<int> z(n + 1);
  int l = 0, r = 0;
  z[0] = 0;
  for (int i = 1; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (z[i] + i < n && s[z[i] + i] == s[z[i]]) ++z[i];
    if (i + z[i] - 1 > r) r = i + z[i] - 1, l = i;
  }
  set<int> substr;
  vector<char> good_pr(n + 1, 0);
  for (int i = 1; i < n; ++i) {
    if (i + z[i] >= n) {
      good_pr[z[i]] = 1;
      substr.insert(z[i] - 1);
    } else {
      substr.insert(z[i]);
    }
  }
  int res = 0;
  for (int i = 1; i <= n; ++i) {
    if (good_pr[i] && substr.lower_bound(i) != substr.end()) res = max(res, i);
  }
  if (res == 0) {
    printf("Just a legend");
  } else {
    for (int i = 0; i < res; ++i) printf("%c", s[i]);
  }
  return 0;
}