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;
int II() {
  int q;
  scanf("%d", &q);
  return q;
}
int mod1 = 1000000007;
int mod2 = 1000000009;
int base = 353;
long long power1[1000006], power2[1000006];
long long hash_value1[1000006];
long long hash_value2[1000006];
void pre() {
  power1[0] = 1;
  power2[0] = 1;
  for (int i = 1; i < 1000004; i++) {
    power1[i] = (power1[i - 1] * base) % mod1;
    power2[i] = (power2[i - 1] * base) % mod2;
  }
}
void compute_hash(string &s) {
  hash_value1[0] = 0;
  hash_value2[0] = 0;
  int N = (int)s.size();
  for (int i = 0; i < N; i++) {
    hash_value1[i + 1] =
        (hash_value1[i] + ((s[i] - 'a' + 1) * power1[i]) % mod1) % mod1;
    hash_value2[i + 1] =
        (hash_value2[i] + ((s[i] - 'a' + 1) * power2[i]) % mod2) % mod2;
  }
}
pair<int, int> find_hash(int x, int y, int N) {
  int temp1 = (hash_value1[y + 1] - hash_value1[x] + mod1) % mod1;
  temp1 = (temp1 * power1[N - x - 1]) % mod1;
  int temp2 = (hash_value2[y + 1] - hash_value2[x] + mod2) % mod2;
  temp2 = (temp2 * power2[N - x - 1]) % mod2;
  return {temp1, temp2};
}
void solve() {
  pre();
  string s;
  cin >> s;
  compute_hash(s);
  int N = (int)s.size();
  vector<int> pa;
  for (int i = 1; i < N; i++) {
    int len = N - i;
    pair<int, int> temp1 = find_hash(0, len - 1, N);
    pair<int, int> temp2 = find_hash(i, i + len - 1, N);
    if (temp1 == temp2) {
      pa.push_back(i);
    }
  }
  reverse(pa.begin(), pa.end());
  int left = 0, right = pa.size() - 1;
  string ans = "Just a legend";
  while (left <= right) {
    int mid = (left + right) / 2;
    int len = pa[mid];
    int len_len = N - len;
    pair<int, int> temp1 = find_hash(0, len_len - 1, N);
    bool bo = 0;
    for (int i = 1; i < len; i++) {
      pair<int, int> temp2 = find_hash(i, i + len_len - 1, N);
      if (temp1 == temp2) {
        bo = 1;
        break;
      }
    }
    if (bo == 1) {
      ans = s.substr(0, len_len);
      left = mid + 1;
    } else
      right = mid - 1;
  }
  cout << ans << endl;
}
int main() { solve(); }