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 lim = 1e6 + 5;
int b[lim];
void solve() {
  string s;
  cin >> s;
  if (int((s).size()) < 3) {
    cout << "Just a legend";
    return;
  }
  int i = 0, j = -1;
  b[0] = -1;
  while (i < int((s).size())) {
    while (j >= 0 && s[i] != s[j]) j = b[j];
    i++;
    j++;
    b[i] = j;
  }
  set<int> m;
  for (int i = 2; i <= int((s).size()) - 1; i++) {
    m.insert(b[i]);
  }
  i = int((s).size()) - 1;
  j = b[i];
  int ans = -1;
  while (j >= 0) {
    if (s[i] == s[j]) {
      if (m.find(j + 1) != m.end()) {
        ans = j + 1;
        break;
      }
    }
    j = b[j];
  }
  if (ans == -1) {
    cout << "Just a legend";
  } else {
    cout << s.substr(0, ans);
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int test = 1, kickstart = 0;
  for (int i = 1; i <= test; i++) {
    if (kickstart) {
      cout << "Case #" << i << ": ", solve(), cout << endl;
    } else
      solve();
  }
  return 0;
}