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[1000005], pre[1000005];
void zalgo(string str, int n) {
  int l = 0, r = 0;
  z[0] = n;
  for (int i = 1; i < n; i++) {
    if (i > r) {
      int j = 0, k = i;
      while (k < n && str[k] == str[j]) {
        k++;
        j++;
      }
      k--;
      z[i] = j;
      if (k > r) {
        r = k;
        l = i;
      }
    } else {
      int k = i;
      int k1 = k - l;
      int b = r - k + 1;
      if (z[k1] < b)
        z[k] = z[k1];
      else if (z[k1] > b)
        z[k] = b;
      else {
        k = r + 1;
        while (k < n && str[k] == str[b]) {
          k++;
          b++;
        }
        k--;
        if (k > r) {
          r = k;
          l = i;
        }
        z[i] = b + r - k;
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  string str;
  cin >> str;
  int final = 0;
  int n = str.length();
  zalgo(str, n);
  pre[1] = z[1];
  for (int i = 2; i < n; i++) {
    pre[i] = max(pre[i - 1], z[i]);
  }
  for (int i = 1; i < n; i++) {
    if (pre[i - 1] >= z[i] && (z[i] == n - i)) {
      final = max(final, z[i]);
    }
  }
  if (final == 0)
    cout << "Just a legend\n";
  else
    cout << str.substr(0, final) << "\n";
}