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 p = 31;
vector<long long> p_pow;
vector<long long> h;
long long get_h(int i1, int len) {
  long long h1 = h[i1 + len - 1];
  if (i1) h1 -= h[i1 - 1];
  return h1;
}
string s;
bool check(int n) {
  if (get_h(0, n) * p_pow[s.length() - 1 - n] != get_h(s.length() - n, n))
    return false;
  for (int i = 1; i < s.length() - n; i++)
    if (get_h(i, n) == get_h(0, n) * p_pow[i - 1]) return true;
  return false;
}
int main() {
  cin >> s;
  p_pow.resize(s.length() + 1);
  h.resize(s.length());
  p_pow[0] = p;
  for (int i = 1; i < s.length(); i++) p_pow[i] = p * p_pow[i - 1];
  for (int i = 0; i < s.length(); i++) {
    h[i] = (s[i] - 'a' + 1) * p_pow[i];
    if (i) h[i] += h[i - 1];
  }
  for (int i = s.length() - 2; i > 0; i--) {
    if (check(i)) {
      string res = "";
      for (int j = 0; j < i; j++) res += s[j];
      cout << res;
      return 0;
    }
  }
  cout << "Just a legend";
}