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;
ifstream in("input.txt");
ofstream out("output.txt");
int n;
int z[1000010];
string s;
int suff[1000010];
char scelta[1000010];
int best;
int w;
void zeta() {
  int l = 0, r = 0;
  for (int i = 1; i < n; i++) {
    if (i > r) {
      l = i;
      r = i;
      while (r < n and 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 (r < n and s[r - l] == s[r]) r++;
        z[i] = r - l;
        r--;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> s;
  n = s.size();
  zeta();
  suff[n - 1] = -1;
  for (int i = n - 1; i > 0; i--) {
    if (z[i] == n - i)
      suff[i] = i;
    else if (i < n - 1)
      suff[i] = suff[i + 1];
  }
  for (int i = 1; i < n - 1; i++) {
    if (z[i] == 0) continue;
    if (z[i] < n - i) {
      if (suff[n - z[i]] != -1 and z[i] > best) {
        w = suff[n - z[i]];
        best = n - suff[n - z[i]];
      }
    } else {
      if (suff[i + 1] != -1 and z[i] - 1 > best) {
        w = suff[n - z[i] + 1];
        best = n - suff[n - z[i] + 1];
      }
    }
  }
  if (best > 0)
    for (int i = w; i < n; i++) cout << s[i];
  else
    cout << "Just a legend";
}