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;
long long F[1000001];
char str[1000001];
long long sL = 0;
vector<long long> pufix[1000001];
int main() {
  long long i, j;
  string s;
  long long lookfor = 1;
  long long precomputed;
  long long need;
  cin >> s;
  for (i = 0; i < s.length(); i++) {
    str[i + 1] = s[i];
  }
  sL = s.length();
  F[0] = 0;
  F[1] = 0;
  for (i = 2; i <= sL; i++) {
    if (str[i] == str[lookfor]) {
      F[i] = lookfor;
      lookfor++;
    } else {
      precomputed = lookfor - 1;
      while (precomputed != 0 && str[i] != str[precomputed + 1]) {
        precomputed = F[precomputed];
      }
      if (precomputed == 0) {
        if (str[i] == str[1]) {
          F[i] = 1;
          lookfor = 2;
        } else {
          F[i] = 0;
          lookfor = 1;
        }
      } else {
        F[i] = precomputed + 1;
        lookfor = F[i] + 1;
      }
    }
    pufix[F[i]].push_back(i);
  }
  need = F[sL];
  while (need != 0) {
    for (i = 0; i < pufix[need].size(); i++) {
      if (pufix[need][i] != sL) {
        for (j = 1; j <= need; j++) {
          printf("%c", str[j]);
        }
        printf("\n");
        return 0;
      }
    }
    need = F[need];
  }
  printf("Just a legend\n");
  return 0;
}