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 mod = 1000000007;
bool mark[1000010], visit[1000010];
int nexti[1000010];
string s;
int main() {
  cin >> s;
  for (int i = 1; i < (int)s.size(); i++) {
    int tmp = nexti[i - 1];
    while (tmp > 0 && s[i] != s[tmp]) tmp = nexti[tmp - 1];
    if (s[i] == s[tmp]) tmp++;
    nexti[i] = tmp;
  }
  int cur = nexti[(int)s.size() - 1];
  while (cur != 0) {
    mark[cur] = true;
    cur = nexti[cur - 1];
  }
  int ans = 0;
  for (int i = 1; i < (int)s.size() - 1; i++) {
    int cur = nexti[i];
    while (cur > 0 && !mark[cur] && !visit[cur]) {
      visit[cur] = true;
      cur = nexti[cur - 1];
    }
    if (mark[cur]) ans = max(ans, cur);
  }
  if (ans == 0)
    cout << "Just a legend" << endl;
  else
    cout << s.substr(0, ans) << endl;
  return 0;
}