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[1000005];
int cnt[1000005];
void update(int id) {
  if (id == 0) return;
  while (id < 1000005) {
    cnt[id]++;
    id += id & -id;
  }
}
void z_algo() {
  int n = s.size();
  for (int i = 1, l = 0, r = 0; i < n; i++) {
    if (r >= i) z[i] = min(z[i - l], r - i + 1);
    while (s[i + z[i]] == s[z[i]]) z[i]++;
    if (i + z[i] - 1 > r) {
      r = i + z[i] - 1;
      l = i;
    }
    update(z[i]);
  }
}
int sum(int id) {
  int s = 0;
  while (id) {
    s += cnt[id];
    id -= id & -id;
  }
  return s;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  z_algo();
  int n = s.size();
  z[0] = n;
  update(z[n]);
  vector<pair<int, int> > ans;
  for (int l = n; l >= 1; l--) {
    if (z[n - l] == l && sum(1000005 - 1) - sum(l - 1) + 1 >= 3) {
      for (int i = 0; i < l; i++) cout << s[i];
      return 0;
    }
  }
  cout << "Just a legend";
}