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;
const int MAXN = 1000500;
int z[MAXN];
int n;
vector<int> zs;
int main() {
  cin >> s;
  n = s.size();
  z[0] = 0;
  int mxne = 0;
  int i, j;
  int l, r;
  for (i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[z[i] + i]) ++z[i];
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
    if (i + z[i] < n)
      mxne = max(mxne, z[i]);
    else
      mxne = max(mxne, z[i] - 1);
  }
  int mxl = 0;
  int mxi;
  for ((i) = (1); (i) < (n); ++(i))
    if (i + z[i] == n && z[i] <= mxne) {
      for ((j) = (i); (j) < (n); ++(j)) printf("%c", s[j]);
      puts("");
      return 0;
    }
  puts("Just a legend");
  return 0;
}