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;
string s;
int kmp[1000007];
vector<int> vec;
set<int> q;
int main() {
  cin >> s;
  int t = 0, pos = -1, x;
  x = s.length();
  kmp[0] = 0;
  for (int i = 1; i < x; i++) {
    while (t > 0 && s[i] != s[t]) {
      t = kmp[t - 1];
    }
    if (s[i] == s[t]) t++;
    kmp[i] = t;
  }
  if (!kmp[x - 1]) {
    cout << "Just a legend";
    return 0;
  }
  while (t > 0) {
    vec.push_back(t);
    t = kmp[t - 1];
  }
  sort(vec.begin(), vec.end());
  for (int i = 0; i < x - 1; i++) q.insert(kmp[i]);
  for (set<int>::reverse_iterator k = q.rbegin(); k != q.rend(); k++) {
    if (binary_search(vec.begin(), vec.end(), *k)) {
      pos = *k;
      break;
    }
  }
  if (pos == -1) {
    cout << "Just a legend";
    return 0;
  }
  for (int i = 0; i < pos; i++) cout << s[i];
}