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;
char s[1000010];
int n;
void KMPTable(char *w, int **t) {
  int i, j, *a;
  *t = new int[n];
  a = *t;
  a[0] = -1;
  a[1] = 0;
  i = 2;
  j = 0;
  while (i < n) {
    if (w[i - 1] == w[j])
      a[i++] = ++j;
    else if (j)
      j = a[j];
    else
      a[i++] = 0;
  }
}
int main() {
  cin >> s;
  n = strlen(s);
  s[n] = '$';
  s[n + 1] = 0;
  n++;
  int *t;
  KMPTable(s, &t);
  int i;
  if (t[n - 1] == 0) {
    cout << "Just a legend";
    return 0;
  }
  for (i = 1; i < n - 1; i++)
    if (t[i] == t[n - 1]) break;
  if (i < n - 1) {
    for (i = 0; i < t[n - 1]; i++) cout << s[i];
  } else {
    int j = t[n - 1];
    if (t[j] > 0) {
      for (i = 0; i < t[j]; i++) cout << s[i];
    } else
      cout << "Just a legend";
  }
  return 0;
}