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 = 2e6 + 500;
const long long INF = 1e13 + 23;
const int MOD = 1e9 + 7;
string s;
int arr[MAXN], mid;
void kmp(string s) {
  for (int i = 1; i < s.size(); i++) {
    int j = arr[i - 1];
    while (s[i] != s[j] && j > 0) j = arr[j - 1];
    if (s[i] == s[j]) ++j;
    arr[i] = j;
    if (i < (int)s.size() - 1) {
      mid = max(mid, j);
    }
  }
}
void solve() {
  cin >> s;
  kmp(s);
  int res = arr[(int)s.size() - 1];
  while (res > mid) {
    res = arr[res - 1];
  }
  if (!res) {
    cout << "Just a legend";
    return;
  }
  string k = "";
  int i = (int)s.size() - 1;
  while (res--) {
    k += s[i];
    i--;
  }
  reverse((k).begin(), (k).end());
  cout << k;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0), cout.tie(0);
  int tt = 1;
  while (tt--) {
    solve();
    cout << '\n';
  }
  return 0;
}