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;
unsigned long long n, p[1000005], ans, l, h[1000005], db[1000005], f;
char s[1000005];
void hhash(unsigned long long x) {
  for (unsigned long long i = 1; i < l; i++) {
    if (i + x - 1 >= l - 1) return;
    unsigned long long sum = h[x - 1];
    if (h[i + x - 1] - h[i - 1] * db[x] == sum) {
      for (unsigned long long k = 0; k < x; k++) cout << s[k];
      f = 1;
      return;
    }
  }
}
void aaa() {
  for (unsigned long long i = 1; i < l; i++) {
    unsigned 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;
  }
  unsigned long long j = p[l - 1];
  while (j > 0) {
    hhash(j);
    if (f == 1)
      return;
    else
      j = p[j - 1];
  }
}
signed main() {
  cin >> s;
  l = strlen(s);
  db[0] = 1;
  for (unsigned long long i = 1; i <= l; i++) db[i] = db[i - 1] * 27;
  h[0] = s[0] - 'a' + 1;
  for (unsigned long long i = 1; i < l; i++)
    h[i] = h[i - 1] * 27 + s[i] - 'a' + 1;
  aaa();
  if (f == 0) cout << "Just a legend\n";
  return 0;
}