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 maxn = 1e6 + 100, base = 37;
long long hashing[maxn], po[maxn];
string s;
void hsh() {
  for (int i = 1; i < s.size(); i++)
    hashing[i] = (s[i] - 'a' + 1) + (hashing[i - 1] * base);
}
long long f(int len, long long k) {
  for (int i = len + 1; i < s.size() - 1; i++) {
    long long m = hashing[i] - hashing[i - len] * po[len];
    if (m == k) return true;
  }
  return false;
}
int main() {
  string a;
  cin >> a;
  s = "0" + a;
  if (a.size() < 3) return cout << "Just a legend" << endl, 0;
  hsh();
  po[0] = 1;
  for (int i = 1; i < maxn; i++) po[i] = (po[i - 1] * base);
  int l = 0, r = s.size() - 3;
  int n = s.size() - 1;
  while (r > 0) {
    int mid = r;
    long long k = hashing[mid];
    long long m = hashing[n] - hashing[n - mid] * po[mid];
    if (k == m) {
      if (f(mid, k)) break;
    }
    r--;
  }
  if (r == 0) {
    return cout << "Just a legend" << endl, 0;
  }
  cout << s.substr(1, r) << endl;
}