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;
int T[1000010];
string s;
void pc(int n) {
  int i = 0;
  int j = -1;
  T[i] = j;
  while (i < n) {
    while (j >= 0 && s[i] != s[j]) j = T[j];
    T[++i] = ++j;
  }
}
bool isp(int sz) {
  int i = 1;
  int j = 0;
  while (i < s.size()) {
    while (j >= 0 && s[i] != s[j]) j = T[j];
    i++;
    j++;
    if (j == sz) return (i != s.size());
  }
  return 0;
}
int main() {
  cin >> s;
  int n = s.size();
  pc(n);
  int anw = *max_element(T + 1, T + n);
  string h = s.substr(0, anw);
  reverse(h.begin(), h.end());
  reverse(s.begin(), s.end());
  pc(n);
  int i = 0;
  int j = 0;
  while (i < h.size()) {
    while (j >= 0 && h[i] != s[j]) j = T[j];
    i++;
    j++;
  }
  string tp = s.substr(0, j);
  reverse(tp.begin(), tp.end());
  cout << (j == 0 ? "Just a legend" : tp) << endl;
}