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;
auto speedup = []() {
  std::ios::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  return nullptr;
}();
static const auto io_sync_off = []() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  return 0;
}();
vector<int> prefixFunction(string s) {
  int n = s.size();
  vector<int> p(n);
  p[0] = 0;
  for (int i = 1; i < n; i++) {
    int j = p[i - 1];
    while (j > 0 && s[i] != s[j]) j = p[j - 1];
    if (s[i] == s[j]) j++;
    p[i] = j;
  }
  return p;
}
bool check(string s, int len) {
  long long int hash = 0, mod = 1000000007, keyHash = 0;
  long long int pow = 1;
  for (int i = 0; i < len - 1; i++) {
    pow = (pow * 26) % mod;
  }
  for (int i = 0; i < len; i++) {
    keyHash = ((keyHash * 26) % mod + s[i] - 'a') % mod;
  }
  for (int i = 1; i <= len; i++) {
    hash = ((hash * 26) % mod + s[i] - 'a') % mod;
  }
  if (hash == keyHash) return true;
  for (int i = len + 1; i < s.size() - 1; i++) {
    hash = ((hash - (pow * (s[i - len] - 'a')) % mod) + mod) % mod;
    hash = ((hash * 26) % mod + s[i] - 'a') % mod;
    if (hash == keyHash) return true;
  }
  return false;
}
int main() {
  string s, imp = "Just a legend";
  cin >> s;
  int n = s.size();
  vector<int> p = prefixFunction(s);
  int len = p[n - 1];
  if (len == 0) {
    cout << imp << endl;
  } else {
    if (len <= s.size() - 2 && check(s, len)) {
      cout << s.substr(0, len) << endl;
    } else {
      len = p[len - 1];
      if (len <= 0) {
        cout << imp << endl;
      } else {
        if (check(s, len)) {
          cout << s.substr(0, len) << endl;
        } else {
          cout << imp << endl;
        }
      }
    }
  }
}