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;
long long int mod = 1000000009;
long long int p = 31;
long long int powe[1000005];
long long int hash1[1000005];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  powe[0] = 1;
  int n = s.length();
  for (int i = 1; i < s.length(); i++) {
    powe[i] = (powe[i - 1] * p) % mod;
  }
  hash1[0] = (s[0] - 'a' + 1);
  for (int i = 1; i < s.length(); i++) {
    hash1[i] = (hash1[i - 1] + powe[i] * (s[i] - 'a' + 1)) % mod;
  }
  vector<int> v;
  for (int i = 0; i < s.length(); i++) {
    if (i != n - 1) {
      if ((hash1[i] * powe[(n - (i + 1))]) % mod ==
          (hash1[n - 1] - hash1[n - (i + 1) - 1] + mod) % mod)
        v.push_back(i + 1);
    } else {
      if ((hash1[i] * powe[(n - (i + 1))]) % mod == hash1[n - 1]) {
        v.push_back(i + 1);
      }
    }
  }
  for (int i = 0; i < v.size(); i++) {
    int l = v[v.size() - (i + 1)];
    for (int j = 1; j < n - l; j++) {
      if ((hash1[l - 1] * powe[((j))]) % mod ==
          (hash1[j + l - 1] - hash1[j - 1] + mod) % mod) {
        for (int p = 0; p < l; p++) cout << s[p];
        return 0;
      }
    }
  }
  cout << "Just a legend";
  return 0;
}