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;
long long const INF = 2147483647, R_INF = 9223372036854775807, MOD = 1e9 + 7;
const int N = 1e6 + 1;
int max_border[N];
void prefix(string str) {
  max_border[0] = -1;
  for (int i = (1); i < (str.size()); i++) {
    max_border[i] = max_border[i - 1];
    while (~max_border[i] && str[i] != str[max_border[i] + 1])
      max_border[i] = max_border[max_border[i]];
    if (str[i] == str[max_border[i] + 1]) max_border[i]++;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string str;
  cin >> str;
  prefix(str);
  int maxi1 = -1, maxi2 = max_border[str.size() - 1];
  for (int i = (1); i < (str.size() - 1); i++)
    maxi1 = max(maxi1, max_border[i]);
  if (maxi1 >= maxi2)
    maxi1 = maxi2;
  else {
    while (maxi1 < maxi2) {
      maxi2 = max_border[maxi2];
    }
  }
  maxi1 = maxi2;
  if (maxi1 == -1) return cout << "Just a legend", 0;
  for (int i = (0); i < (maxi1 + 1); i++) {
    cout << str[i];
  }
}