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;
unsigned long long p = 29;
unsigned long long mod = 1000000009;
unsigned long long h[1000009];
unsigned long long power[1000009];
unsigned long long hash_range(int l, int r) {
  int len = r - l + 1;
  unsigned long long x = power[len] * h[r + 1];
  x %= mod;
  return (h[l] - x + mod) % mod;
}
int main() {
  string s;
  cin >> s;
  int n = s.size();
  power[0] = 1;
  for (int i = 1; i < n; i++) power[i] = (power[i - 1] * p) % mod;
  h[n - 1] = s[n - 1] - 'a';
  for (int i = n - 2; i >= 0; i--) {
    h[i] = (h[i + 1] * p) % mod;
    h[i] = (h[i] + s[i] - 'a') % mod;
  }
  vector<int> ss;
  ss.reserve(n);
  for (int i = 0; i + 1 < n; i++) {
    unsigned long long lh = hash_range(0, i);
    unsigned long long rh = hash_range(n - 1 - i, n - 1);
    if (lh == rh) ss.push_back(i + 1);
  }
  int ans = 0;
  for (auto it = ss.rbegin(); !ans && it != ss.rend(); it++) {
    int len = *it;
    unsigned long long hh = hash_range(0, len - 1);
    for (int i = 1; i + len - 1 < n - 1; i++) {
      unsigned long long xx = hash_range(i, i + len - 1);
      if (xx == hh) {
        ans = len;
        break;
      }
    }
  }
  if (ans)
    cout << s.substr(0, ans) << '\n';
  else
    cout << "Just a legend\n";
}