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;
vector<unsigned long long> p_pow, h;
void p_hash(const string& str) {
  p_pow.resize(str.size());
  h.resize(str.size());
  const int p = 53;
  p_pow[0] = p;
  for (size_t i = 1; i < str.size(); ++i) p_pow[i] = p_pow[i - 1] * p;
  for (size_t i = 0; i < str.size(); ++i) {
    h[i] = (str[i] - 'a' + 1) * p_pow[i];
    if (i) h[i] += h[i - 1];
  }
}
unsigned long long s_hash(int i, int len) {
  unsigned long long res = h[i + len - 1];
  if (i) res -= h[i - 1];
  return res * p_pow[h.size() - i - 1];
}
int foo(int q) {
  int l = 0, r = h.size() - q, mid;
  while (r - l > 1) {
    mid = (l + r) / 2;
    if (s_hash(0, mid) == s_hash(q, mid))
      l = mid;
    else
      r = mid;
  }
  return l;
}
int main(void) {
  string str;
  cin >> str;
  p_hash(str);
  int mx = 0;
  for (int i = 1; i < str.size(); ++i) mx = max(mx, foo(i));
  for (int i = mx; i > 0; --i) {
    if (s_hash(0, i) == s_hash(str.size() - i, i)) {
      cout << str.substr(0, i);
      return 0;
    }
  }
  cout << "Just a legend";
  return 0;
}