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 text, pattern;
int sizeText, sizePattern;
int prefix[1000006];
vector<int> results;
bool f[1000006];
void generatePrefix() {
  prefix[0] = 0;
  for (int i = 0, j = 2; j < sizePattern; j++) {
    while (i > 0 && pattern[i + 1] != pattern[j]) i = prefix[i];
    if (pattern[i + 1] == pattern[j]) i = i + 1;
    prefix[j] = i;
  }
  for (int i = 2; i < pattern.size() - 1; i++) f[prefix[i]] = 1;
  int vv = prefix[pattern.size() - 1];
  while (vv) {
    if (f[vv]) {
      cout << pattern.substr(1, vv) << endl;
      exit(0);
    }
    vv = prefix[vv];
  }
  cout << "Just a legend" << endl;
  exit(0);
}
void matchingCheck() {
  int i = 1, j = 1, k = 1;
  while (i < sizeText) {
    while (j < sizePattern && text[i] == pattern[j]) i++, j++;
    if (j == sizePattern) results.push_back(k);
    if (prefix[j - 1] > 0)
      k = i - prefix[j - 1];
    else {
      if (i == k) i++;
      k = i;
    }
    if (j > 1) j = prefix[j - 1] + 1;
  }
}
int main() {
  cin >> pattern;
  pattern = "0" + pattern;
  sizePattern = pattern.size();
  generatePrefix();
  matchingCheck();
  cout << "PREFIX" << endl;
  for (int i = 0; i < pattern.size(); i++) cout << prefix[i] << ' ';
  cout << endl;
  cout << "RESULTS " << endl;
  for (int i = 0; i < results.size(); i++) cout << results[i] << ' ';
  cout << endl;
  return 0;
}