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 z[1000006] = {0}, h[1000005] = {0};
int main() {
  string s;
  cin >> s;
  int l, r, ma = -1, i;
  l = r = 0;
  for (i = 1; i < s.size(); i++) {
    if (i > r) {
      l = r = i;
      while (s[r - l] == s[r]) 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 (s[r - l] == s[r]) r++;
        z[i] = r - l;
        r--;
      }
    }
  }
  for (i = 1; i < s.size(); i++)
    if (i + z[i] == s.size()) h[z[i]] = z[i];
  ;
  for (i = 1; i < 1000001; i++)
    if (!h[i]) h[i] = h[i - 1];
  for (i = 1; i < s.size(); i++)
    if (z[i])
      if (z[i] + i == s.size())
        ma = max(ma, h[z[i] - 1]);
      else
        ma = max(ma, h[z[i]]);
  if (ma > 0)
    for (i = 0; i < ma; i++) printf("%c", s[i]);
  else
    printf("Just a legend");
  return 0;
}