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;
const int max_N = 1000000 + 10;
const long long base[2] = {37, 283}, mod[2] = {1162811119, 1000003987};
long long h[2][max_N], pw[2][max_N];
int sz;
bool check(int x) {
  long long tmp[2];
  for (int k = 0; k < 2; k++)
    tmp[k] =
        (h[k][sz] - ((h[k][sz - x] * pw[k][x]) % mod[k]) + mod[k]) % mod[k];
  if (h[0][x] != tmp[0] || h[1][x] != tmp[1]) return false;
  for (int i = 1; i < sz - x; i++) {
    for (int k = 0; k < 2; k++)
      tmp[k] =
          (h[k][i + x] - ((h[k][i] * pw[k][x]) % mod[k]) + mod[k]) % mod[k];
    if (h[0][x] == tmp[0] && h[1][x] == tmp[1]) return true;
  }
  return false;
}
int main() {
  ios::sync_with_stdio(false);
  string s;
  cin >> s;
  sz = s.size();
  for (int k = 0; k < 2; k++) {
    pw[k][0] = 1;
    for (int i = 0; i < sz; i++) {
      h[k][i + 1] = (((h[k][i] * base[k]) % mod[k]) + s[i]) % mod[k];
      pw[k][i + 1] = (pw[k][i] * base[k]) % mod[k];
    }
  }
  for (int i = sz - 2; i >= 1; i--)
    if (check(i)) {
      cout << s.substr(0, i) << endl;
      return 0;
    }
  cout << "Just a legend\n";
  return 0;
}