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 pre[1000001];
void Prefix(int n, string str) {
  int i, j;
  pre[0] = 0;
  i = 1;
  j = 0;
  while (i < n) {
    if (str[i] == str[j]) {
      pre[i] = j + 1;
      i++;
      j++;
    } else {
      if (j == 0) {
        pre[i] = 0;
        i++;
      } else {
        j = pre[j - 1];
      }
    }
  }
}
int main() {
  int i, j, n, m, k, index;
  string str;
  cin >> str;
  n = str.length();
  Prefix(n, str);
  if (pre[n - 1] == 0) {
    cout << "Just a legend" << endl;
    return 0;
  } else {
    j = pre[n - 1];
    for (i = 0; i < n - 1; i++) {
      if (pre[i] == j) {
        cout << str.substr(0, j) << endl;
        return 0;
      }
    }
    j = pre[pre[n - 1] - 1];
    if (j == 0) {
      cout << "Just a legend" << endl;
      return 0;
    } else {
      cout << str.substr(0, j) << endl;
      return 0;
    }
  }
  return 0;
}