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 main() {
  string s;
  cin >> s;
  long long n = s.length();
  long long p[n];
  p[0] = 0;
  for (long long i = 1; i < n; i++) {
    long long j = p[i - 1];
    while (j > 0 && s[j] != s[i]) {
      j = p[j - 1];
    }
    if (s[j] == s[i]) {
      j++;
    }
    p[i] = j;
  }
  char s1[n];
  for (long long i = n - 1; i >= 0; i--) {
    s1[i] = s[n - 1 - i];
  }
  long long p1[n];
  p1[0] = 0;
  for (long long i = 1; i < n; i++) {
    long long j = p1[i - 1];
    while (j > 0 && s1[j] != s1[i]) {
      j = p1[j - 1];
    }
    if (s1[j] == s1[i]) {
      j++;
    }
    p1[i] = j;
  }
  long long op = 0, ans = p[n - 1];
  for (long long i = 1; i < n - 1; i++) {
    if (p[i] == p1[n - i + p[i] - 2]) {
      ans = min(p[i], p1[n - i + p[i] - 2]);
      if (ans > op) {
        op = ans;
      }
    }
  }
  if (op == 0) {
    cout << "Just a legend";
  }
  for (long long i = 0; i < op; i++) {
    cout << s[i];
  }
  return 0;
}