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;
signed main() {
  string s;
  cin >> s;
  long long n = s.size();
  long long ldp[n];
  long long rdp[n];
  memset(ldp, 0, sizeof(ldp));
  memset(rdp, 0, sizeof(rdp));
  long long i = 0;
  long long j = 1;
  while (j < n) {
    if (s[i] == s[j]) {
      ldp[j] = i + 1;
      i++;
      j++;
    } else {
      if (i == 0) {
        ldp[j] = 0;
        j++;
      } else {
        i = ldp[i - 1];
      }
    }
  }
  i = n - 1;
  j = n - 2;
  while (j >= 0) {
    if (s[i] == s[j]) {
      rdp[j] = n - i;
      i--;
      j--;
    } else {
      if (i == n - 1) {
        rdp[j] = 0;
        j--;
      } else {
        i = n - 1 - rdp[i + 1];
      }
    }
  }
  long long ans = 0;
  long long ansInd = 0;
  for (long long i = 1; i < n - 1; i++) {
    if (ldp[i] > 0) {
      long long ind = i - ldp[i] + 1;
      if (ldp[i] == rdp[ind]) {
        if (ldp[i] > ans) {
          ans = ldp[i];
          ansInd = ind;
        }
      }
    }
  }
  if (ans > 0) {
    for (long long i = 0; i < ans; i++) {
      cout << s[ansInd + i];
    }
    cout << "\n";
  } else {
    cout << "Just a legend\n";
  }
}