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 s;
int z[(1000000 + 5)];
void input() { getline(cin, s); }
int M[(1000000 + 5)];
void solve() {
  z[0] = s.size();
  int l = 0, r = 0;
  for (int i = 1; i <= s.size() - 1; ++i) {
    if (i > r) {
      l = r = i;
      while (s[r] == s[r - l] && r < s.size()) ++r;
      r--;
      z[i] = r - l + 1;
    } else if (z[i - l] < r - i + 1) {
      z[i] = z[i - l];
    } else {
      l = i;
      while (s[r] == s[r - l] && r < s.size()) ++r;
      r--;
      z[i] = r - l + 1;
    }
  }
  M[1] = z[1];
  for (int i = 2; i <= s.size() - 1; ++i) M[i] = max(z[i], M[i - 1]);
  int res = -1;
  for (int i = s.size() - 1; i >= 1; i--)
    if (z[i] == s.size() - 1 - i + 1) {
      if (M[i - 1] >= z[i]) res = i;
    }
  if (res != -1) {
    for (int i = res; i <= s.size() - 1; ++i) cout << s[i];
  } else
    cout << "Just a legend";
}
int main() {
  iostream::sync_with_stdio(0);
  input();
  solve();
}