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 z[1000100];
string s;
void Z_function_wrong(string st) {
  memset(z, 0, sizeof(z));
  int i = 0, l = 0, r = 0, d = s.length();
  while (i < d) {
    if (i > r) {
      while (st[z[i]] == st[i + z[i]] && i + z[i] < d) z[i]++;
      r = i + z[i] - 1;
      l = i;
    } else
      z[i] = min(z[i - l], r - i + 1);
    i++;
  }
}
void Z_function_correct(string st) {
  memset(z, 0, sizeof(z));
  int i = 1, l = 0, r = 0, d = st.length();
  while (i < d) {
    if (i <= r) z[i] = min(z[i - l], r - i + 1);
    while (st[z[i]] == st[i + z[i]] && i + z[i] < d) z[i]++;
    if (i + z[i] - 1 > r) {
      r = i + z[i] - 1;
      l = i;
    }
    i++;
  }
}
int main() {
  cin >> s;
  int t = s.length(), ind = 0, maxz = 0;
  Z_function_correct(s);
  for (int i = 1; i < t; i++) {
    if (z[i] == t - i && maxz >= t - i) {
      ind = i;
      break;
    }
    maxz = max(maxz, z[i]);
  }
  if (ind != 0)
    for (int i = ind; i < t; i++) cout << s[i];
  else
    cout << "Just a legend";
  return 0;
}