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 MAXN = 1000007;
int Z[MAXN];
int cnt[MAXN];
int suff[MAXN];
int main() {
  ios::sync_with_stdio(false);
  string s;
  cin >> s;
  int L = 0, R = 0;
  int n = s.size();
  Z[0] = n;
  for (int i = 1; i < n; i++) {
    if (i > R) {
      L = i;
      R = i;
    } else {
      int k = i - L;
      if (Z[k] < R - i + 1) {
        Z[i] = Z[k];
        continue;
      } else {
        L = i;
      }
    }
    while (R < n && s[R - L] == s[R]) R++;
    Z[i] = R - L;
    R--;
  }
  for (int i = 1; i < n; i++) {
    cnt[Z[i]]++;
  }
  for (int i = n - 1; i >= 0; i--) {
    suff[i] = suff[i + 1] + cnt[i];
  }
  for (int i = 1; i < n; i++) {
    if (Z[i] + i == n && suff[Z[i]] >= 2) {
      for (int j = i; j < n; j++) {
        cout << s[j];
      }
      cout << '\n';
      return 0;
    }
  }
  cout << "Just a legend\n";
}