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 N = 1000002;
int check[N];
vector<int> prefix(int n, string pattern) {
  int index = 0;
  vector<int> lps(n);
  for (int i = 1; i < n;) {
    if (pattern[index] == pattern[i]) {
      lps[i] = index + 1;
      i++;
      index++;
    } else {
      if (index)
        index = lps[index - 1];
      else
        lps[i] = 0, i++;
    }
  }
  return lps;
}
int main() {
  int t = 1;
  while (t--) {
    string s;
    int n;
    cin >> s;
    n = s.length();
    vector<int> lps = prefix(n, s);
    for (int i = 0; i < n - 1; i++) check[lps[i]]++;
    int j = n - 1;
    while (lps[j] > 0) {
      if (check[lps[j]]) {
        for (int i = 0; i < lps[j]; i++) cout << s[i];
        printf("\n");
        return 0;
      }
      j = lps[j - 1];
    }
    cout << "Just a legend\n";
  }
  return 0;
}