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 cad[1000010];
int z[1000010];
int main() {
  scanf("%s", cad);
  int n = strlen(cad);
  int ini = 0, fin = 0;
  multiset<int> lista;
  for (int i = 1; i < n; i++) {
    if (i <= fin) z[i] = min(fin - i + 1, z[i - ini]);
    while (i + z[i] < n && cad[z[i]] == cad[i + z[i]]) z[i]++;
    if (i + z[i] - 1 > fin) {
      ini = i;
      fin = i + z[i] - 1;
    }
    lista.insert(z[i]);
  }
  int resp = -1;
  for (int i = 0; i < n; i++) {
    if (i + z[i] == n) {
      int cnt = 0;
      auto p = lista.find(z[i]);
      while (p != lista.end() && cnt < 2) {
        cnt++;
        p++;
      }
      if (cnt == 2) {
        resp = z[i];
        break;
      }
    }
  }
  if (resp == -1)
    printf("Just a legend\n");
  else {
    for (int i = 0; i < resp; i++) printf("%c", cad[i]);
    printf("\n");
  }
  return 0;
}