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 = 1e6 + 5;
const unsigned long long seed = 131;
unsigned long long Hash[MAX], P[MAX];
char s[MAX];
int n;
unsigned long long get(int l, int r) {
  return Hash[r] - Hash[l - 1] * P[r - l + 1];
}
int b[MAX], tot;
bool ok(int x) {
  unsigned long long tar = get(1, x);
  for (int l = 2; l + x - 1 < n; l++) {
    int r = l + x - 1;
    if (tar == get(l, r)) return 1;
  }
  return 0;
}
int main() {
  cin >> s + 1;
  n = strlen(s + 1);
  P[0] = 1;
  for (int i = 1; i <= n; i++) P[i] = P[i - 1] * seed;
  for (int i = 1; i <= n; i++) {
    Hash[i] = Hash[i - 1] * seed + s[i] - 'a' + 1;
  }
  for (int i = 1; i <= n; i++) {
    if (get(1, i) == get(n - i + 1, n)) b[++tot] = i;
  }
  int l = 1, r = tot, ans = -1, mid;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (ok(b[mid]))
      l = mid + 1, ans = b[mid];
    else
      r = mid - 1;
  }
  if (ans == -1) {
    printf("Just a legend\n");
    return 0;
  }
  for (int i = 1; i <= ans; i++) printf("%c", s[i]);
  return 0;
}