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 MAXN = 1e6 + 9;
bool done[MAXN];
int pi[MAXN];
string s;
int len;
inline void goF() {
  pi[0] = pi[1] = 0;
  for (int i = 2; i <= len; ++i) {
    char cur = s[i - 1];
    int val = pi[i - 1];
    while (1) {
      if (cur == s[val]) {
        pi[i] = val + 1;
        break;
      }
      if (!val) {
        pi[i] = 0;
        break;
      }
      val = pi[val];
    }
  }
}
int main() {
  memset(done, false, sizeof(done));
  memset(pi, 0, sizeof(pi));
  cin >> s;
  len = (int)s.length();
  goF();
  for (int i = 0; i < len; ++i) {
    done[pi[i]] = true;
  }
  int ans = len;
  while (true) {
    if (done[ans] || (!ans)) break;
    ans = pi[ans];
  }
  if (!ans)
    puts("Just a legend");
  else
    printf("%s\n", s.substr(0, ans).c_str());
  return 0;
}