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;
string str;
int pre[1000009];
bool flag[1000009];
int KMP() {
  memset(flag, 0, sizeof(flag));
  int k = 0;
  pre[0] = 0;
  for (int i = 1; i < ((int)str.size()); i++) {
    while (k > 0 && str[k] != str[i]) k = pre[k - 1];
    if (str[i] == str[k]) k++;
    pre[i] = k;
  }
  int val = pre[((int)str.size()) - 1];
  while (val > 0) {
    flag[val] = 1;
    val = pre[val - 1];
  }
  int max_val = -1;
  for (int i = 1; i < ((int)str.size()); i++) {
    val = pre[i];
    if (flag[val]) {
      if (0 < (i + 1) - val && i < ((int)str.size()) - 1) {
        max_val = max(val, max_val);
      }
    }
  }
  return max_val;
}
int main() {
  while (cin >> str) {
    int ans = KMP();
    if (ans != -1)
      cout << str.substr(0, ans) << endl;
    else
      cout << "Just a legend" << endl;
  }
  return 0;
}