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;
vector<int> sublength;
unsigned long long power[1000005], hsh[1000005];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  power[0] = 1;
  for (int i = 1; i < 1000005; i++) power[i] = power[i - 1] * 13331;
  string s;
  cin >> s;
  int l = s.size();
  s = '#' + s;
  for (int i = 1; i <= l; i++) {
    hsh[i] = hsh[i - 1] * 13331 + s[i];
  }
  for (int i = 1, j = l; i <= l && j >= 1; i++, j--) {
    unsigned long long pre = hsh[i];
    unsigned long long suf = hsh[l] - hsh[j - 1] * power[l - j + 1];
    if (pre == suf) sublength.push_back(i);
  }
  for (int i = sublength.size() - 1; i >= 0; i--) {
    int p = sublength[i];
    for (int j = 2; j + p - 1 < l; j++) {
      unsigned long long suf = hsh[j + p - 1] - hsh[j - 1] * power[p];
      unsigned long long pre = hsh[p];
      if (suf == pre) {
        cout << s.substr(j, p) << endl;
        return 0;
      }
    }
  }
  cout << "Just a legend" << endl;
}