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 sz = 1e6 + 6;
int z[sz], n;
void z_fun(string s) {
  int l = 0, r = 0;
  for (int i = 1; i < n; i++) {
    int j = 0;
    if (i <= r) {
      j = min(r - i + 1, z[i - l]);
      z[i] = j;
    }
    for (; j < n && i + j < n; j++) {
      if (s[j] != s[i + j]) break;
      ++z[i];
    }
    if (z[i] + i - 1 >= r) {
      l = i;
      r = z[i] + i - 1;
    }
  }
  return;
}
int main() {
  string s;
  cin >> s;
  n = (int)s.size();
  z_fun(s);
  vector<int> ps, m;
  for (int i = 0; i < n; i++) {
    if (i + z[i] == n) {
      ps.push_back(z[i]);
      if (i != 0 && z[i] != 1) m.push_back(z[i] - 1);
    } else if (z[i] != 0)
      m.push_back(z[i]);
  }
  int maxi = -1;
  sort(m.begin(), m.end());
  for (int i = 0; i < ps.size(); i++) {
    int index = lower_bound(m.begin(), m.end(), ps[i]) - m.begin();
    if (index != (int)m.size()) maxi = max(maxi, ps[i]);
  }
  if (maxi != -1)
    for (int i = 0; i < maxi; i++) cout << s[i];
  else
    cout << "Just a legend";
  return cout << endl, 0;
}