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>
#pragma Ofast
using namespace std;
long long base = 311;
long long mod = 1000000007;
long long n, z, ans = -1;
long long Hash[1111111], POW[1111111];
long long gethash(int i, int j) {
  return (Hash[j] - Hash[i - 1] * POW[j - i + 1] + mod * mod) % mod;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie();
  string s;
  cin >> s;
  n = s.length();
  POW[0] = 1;
  Hash[0] = s[0] - 'a' + 1;
  for (long long i = 1; i < n; i++) {
    POW[i] = POW[i - 1] * base % mod;
    Hash[i] = (Hash[i - 1] * base + s[i] - 'a' + 1) % mod;
  }
  for (int k = 0; k < n - 2; k++) {
    int x = gethash(0, k);
    int y = gethash(n - 1 - k, n - 1);
    if (x != y) continue;
    for (int i = 1; i + k < n - 1; i++) {
      z = gethash(i, i + k);
      if (x == z) {
        ans = k;
        break;
      }
    }
  }
  if (ans == -1)
    cout << "Just a legend";
  else
    for (int i = 0; i <= ans; i++) cout << s[i];
}