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], n, L = 0, R = 0;
string S;
vector<pair<int, int> > luu;
int main() {
  cin >> S;
  n = S.size();
  Z[0] = n;
  for (int i = 1; i < n; i++)
    if (i > R) {
      L = R = i;
      while (R < n && S[R] == S[R - L]) 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 && S[R] == S[R - L]) R++;
        Z[i] = R - L;
        R--;
      }
    }
  for (int i = 1; i < n; i++)
    if (Z[i] + i == n) luu.push_back(make_pair(i, Z[i]));
  if (luu.empty()) {
    cout << "Just a legend";
    return 0;
  }
  for (int i = 0; i < luu.size(); i++) {
    int kt = 0;
    for (int j = 1; j < luu[i].first; j++)
      if (Z[j] >= luu[i].second) {
        kt = 1;
        break;
      }
    if (kt == 1) {
      for (int j = 0; j < luu[i].second; j++) cout << S[j];
      return 0;
    }
  }
  cout << "Just a legend";
  return 0;
}