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;
long long i1, i2, teq = 0, eq[1000050], l1, ans;
string s;
int main() {
  cin >> s;
  l1 = s.length();
  s = ' ' + s;
  for (i1 = 2; i1 <= l1; i1++) {
    while (i2 >= 0) {
      if (s[i1] == s[i2 + 1]) {
        i2++;
        eq[i1] = i2;
        break;
      } else {
        i2 = eq[i2];
        if (!i2) {
          if (s[i1] == s[i2 + 1]) {
            i2++;
            eq[i1] = i2;
          }
          break;
        }
      }
    }
  }
  ans = -1;
  for (i1 = l1 - 1; i1 >= 1; i1--) {
    if (eq[i1] == eq[l1]) {
      ans = eq[l1];
    }
  }
  if (ans == -1) {
    ans = eq[eq[l1]];
  }
  if (ans) {
    for (i1 = 1; i1 <= ans; i1++) {
      cout << s[i1];
    }
  } else {
    cout << "Just a legend";
  }
  return 0;
}