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;
#pragma comment(linker, "/STACK:64000000")
inline void imp() {
  printf("Just a legend\n");
  exit(0);
}
string s;
int n;
long long H[1 << 20];
long long PP[1 << 20];
inline long long getHash(int l, int r) {
  long long res = H[r];
  if (l) res -= H[l - 1] * PP[r - l + 1];
  return res;
}
inline int check(int l) {
  long long PH = getHash(0, l - 1);
  for (int i = 1; i + l < n; ++i) {
    long long curHash = getHash(i, i + l - 1);
    if (curHash == PH) return 1;
  }
  return 0;
}
int main() {
  cin >> s;
  n = (int)s.length();
  if (n < 3) imp();
  H[0] = (long long)s[0];
  for (int i = 1; i < n; ++i) H[i] = H[i - 1] * 1103 + (long long)s[i];
  PP[0] = 1;
  for (int i = 1; i <= n; ++i) PP[i] = PP[i - 1] * 1103;
  int res = -1;
  int l = 1, r = n - 2;
  while (l <= r) {
    int mid = (l + r) >> 1;
    if (check(mid)) {
      res = mid;
      l = mid + 1;
    } else {
      r = mid - 1;
    }
  }
  if (res == -1) imp();
  for (; res; --res) {
    if (getHash(0, res - 1) == getHash(n - res, n - 1)) break;
  }
  if (!res) res = -1;
  if (res != -1) {
    for (int i = 0; i < res; ++i) printf("%c", s[i]);
    printf("\n");
    return 0;
  }
  imp();
  return 0;
}