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;
void computeLPSArray(string pat, int M, vector<int> &lps) {
  int len = 0;
  lps[0] = 0;
  int i = 1;
  while (i < M) {
    if (pat[i] == pat[len]) {
      len++;
      lps[i] = len;
      i++;
    } else {
      if (len != 0) {
        len = lps[len - 1];
      } else {
        lps[i] = 0;
        i++;
      }
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  string s;
  cin >> s;
  int n = s.length();
  vector<int> lps(n);
  computeLPSArray(s, n, lps);
  int k = lps[lps[n - 1] - 1];
  if (lps[n - 1] == 0) {
    cout << "Just a legend";
    return 0;
  } else {
    int flag = 0;
    for (int j = n - 2; j > 0; j--) {
      if (lps[j] == lps[n - 1]) {
        flag = 1;
        break;
      } else if (lps[j] == k) {
        flag = 2;
      }
    }
    if (flag == 1) {
      cout << s.substr(0, lps[n - 1]);
    } else if (flag == 2) {
      if (k == 0) {
        cout << "Just a legend";
      } else
        cout << s.substr(0, k);
    } else {
      cout << "Just a legend";
    }
  }
  return 0;
}