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;
string s;
int p[1000010], a[1000010], n, S = 0;
inline int hh(int x, int y) { return a[y] - a[x - 1] * p[y - x + 1]; }
int ff(int x) {
  int L = 1, R = n - x;
  while (L <= R) {
    int M = (L + R) / 2;
    if (hh(1, M) == hh(x, x + M - 1))
      L = M + 1;
    else
      R = M - 1;
  }
  return R;
}
int main() {
  cin >> s;
  n = s.size();
  p[0] = 1;
  for (int i = 1; i < n + 5; i++) p[i] = p[i - 1] * 1000000007;
  for (int i = 1; i <= n; i++) a[i] = a[i - 1] * 1000000007 + s[i - 1];
  for (int i = 2; i <= n; i++) S = max(S, ff(i));
  for (int i = S; i >= 1; i--)
    if (hh(1, i) == hh(n - i + 1, n)) {
      for (int j = 0; j < i; j++) putchar(s[j]);
      puts("");
      return 0;
    }
  puts("Just a legend");
  return 0;
}