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 long long int INF = 1e18;
inline long long int in() {
  long long int p = 0;
  register char ch = 0;
  while (ch < '0' or ch > '9') {
    ch = getchar();
  }
  while (ch >= '0' and ch <= '9') {
    p = (p << 1) + (p << 3) + ch - '0';
    ch = getchar();
  }
  return p;
}
long long int par[1000001];
set<long long int> s;
void kmp(string st) {
  long long int k;
  memset(par, 0, sizeof(par));
  par[0] = k = 0;
  for (long long int i = 1; i < st.size(); ++i) {
    while (k > 0 && st[k] != st[i]) k = par[k - 1];
    if (st[k] == st[i]) k++;
    par[i] = k;
    if (i != (st.size() - 1)) s.insert(k);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string str;
  cin >> str;
  kmp(str);
  long long int ans = par[str.size() - 1];
  if (ans != 0 && s.count(ans) == 1)
    cout << str.substr(0, ans) << endl;
  else {
    ans = par[ans - 1];
    if (ans != 0 && s.count(ans) == 1)
      cout << str.substr(0, ans) << endl;
    else
      cout << "Just a legend" << endl;
  }
  return 0;
}