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 long long base = 196613, maxn = 1e6 + 9, mod = 1e9 + 7;
string s;
long long n, b[maxn], h[maxn], l1, r1;
void build() {
  b[0] = 1;
  h[0] = s[0];
  for (int i = 1; i < n; i++) {
    h[i] = ((h[i - 1] * base) % mod + s[i]) % mod;
  }
  for (int i = 1; i < maxn; i++) b[i] = (b[i - 1] * base) % mod;
}
long long gethash(int l, int r) {
  if (l - 1 >= 0)
    return (mod + h[r] - (h[l - 1] * b[r - l + 1]) % mod) % mod;
  else
    return (h[r] + mod) % mod;
}
bool ch(long long a) {
  for (int i = 1; i < n - a; i++)
    if (gethash(i, i + a - 1) == gethash(0, a - 1)) return 1;
  return 0;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  n = (int)s.size();
  build();
  for (int mid = n - 1; mid >= 1; mid--) {
    if (gethash(0, mid - 1) == gethash(n - mid, n - 1) && ch(mid)) {
      for (int j = 0; j < mid; j++) cout << s[j];
      return 0;
    }
  }
  cout << "Just a legend";
}