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;
const int N = 1000000 + 10;
const int M = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
const int oo = 1000000000;
int n, z[N], l, r;
char s[N];
int main() {
  scanf("%s", s);
  n = strlen(s);
  for (int i = 1; i < n; ++i) {
    if (i > r) {
      l = r = i;
      while (r < n && s[r] == s[r - l]) ++r;
      z[i] = r - l;
      --r;
    } else {
      int k = i - l;
      if (z[k] < r - i + 1)
        z[i] = z[k];
      else {
        l = i;
        while (r < n && s[r] == s[r - l]) ++r;
        z[i] = r - l;
        --r;
      }
    }
  }
  int ans = 0, mx = 0;
  for (int i = 1; i < n; ++i) {
    if (z[i] == n - i && mx >= n - i) {
      ans = n - i;
      break;
    }
    mx = max(mx, z[i]);
  }
  if (!ans)
    puts("Just a legend");
  else {
    s[ans] = 0;
    printf("%s\n", s);
  }
  return 0;
}