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 pattern[1000005];
int p[1000005];
void preprocessing(char pattern[]) {
  int size = strlen(pattern + 1);
  p[1] = 0;
  int k = 0;
  for (int i = 2; i <= size; i++) {
    while (k > 0 && pattern[i] != pattern[k + 1]) {
      k = p[k];
    }
    if (pattern[i] == pattern[k + 1]) k++;
    p[i] = k;
  }
}
void print(int i) {
  pattern[i + 1] = '\0';
  cout << (pattern + 1);
}
int main() {
  cin >> (pattern + 1);
  preprocessing(pattern);
  int l = strlen(pattern + 1);
  if (p[l] == 0)
    puts("Just a legend");
  else {
    int ans = -1;
    for (int i = 1; i < l; i++)
      if (p[i] == p[l]) {
        ans = p[i];
        print(ans);
        return 0;
      }
    ans = p[p[l]];
    if (ans == 0)
      puts("Just a legend");
    else
      print(ans);
  }
  return 0;
}