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;
int main() {
  cin.tie(NULL);
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  int prefix[s.length()];
  int j = 0;
  prefix[0] = 0;
  for (int i = 1; i < s.length(); i++) {
    if (s[i] == s[j]) {
      prefix[i] = j + 1;
      j++;
    } else {
      while (j != 0) {
        j = prefix[j - 1];
        if (s[i] == s[j]) {
          j++;
          prefix[i] = j;
          break;
        }
      }
      if (j == 0) prefix[i] = 0;
    }
  }
  int hi = prefix[s.length() - 1];
  int flag = 0;
  for (int i = 0; i < s.length() - 1; i++) {
    if (prefix[i] == hi) {
      flag = 1;
      break;
    }
  }
  if (flag == 1 && hi != 0) {
    cout << s.substr(s.length() - hi) << endl;
  } else if (hi == 0)
    cout << "Just a legend\n";
  else {
    if (prefix[hi - 1] == 0)
      cout << "Just a legend\n";
    else
      cout << s.substr(s.length() - prefix[hi - 1]) << endl;
  }
}