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;
const int p = 31;
const int m = 1e9 + 9;
int main() {
  int t;
  t = 1;
  while (t--) {
    string s;
    cin >> s;
    int l = s.length();
    s = '1' + s;
    vector<long long> p_pow(l);
    p_pow[0] = 1;
    for (int i = 1; i < (int)p_pow.size(); i++) {
      p_pow[i] = (p_pow[i - 1] * p) % m;
    }
    vector<long long> hash(l + 1);
    for (int i = 1; i <= l; i++) {
      hash[i] = (hash[i - 1] + (s[i] - 'a' + 1) * p_pow[i - 1]) % m;
    }
    vector<int> lens;
    vector<long long> comps;
    for (int i = 1; i <= l - 1; i++) {
      int lft = i;
      int rt = l - i + 1;
      long long h1 = hash[i];
      long long h2 = (hash[l] - hash[rt - 1] + m) % m;
      if (h1 * p_pow[rt - 1] % m == h2) {
        lens.push_back(i);
        comps.push_back(h1);
      }
    }
    int le = 0;
    int r = lens.size() - 1;
    int ans = -1;
    vector<int> inds;
    for (int i = 1; i <= l; i++) {
      if (i != 1 && s[i] == s[1]) {
        inds.push_back(i);
      }
    }
    if (inds.size() > 0) inds.pop_back();
    while (le <= r && inds.size() > 0) {
      int mid = (le + r) / 2;
      int cand_len = lens[mid];
      bool found = false;
      for (auto &val : inds) {
        int lft = val;
        int rt = val + cand_len - 1;
        if (rt >= l) continue;
        long long h = (hash[rt] - hash[lft - 1] + m) % m;
        if ((comps[mid] * p_pow[lft - 1]) % m == h) {
          found = true;
          break;
        }
      }
      if (found) {
        ans = cand_len;
        le = mid + 1;
      } else
        r = mid - 1;
    }
    if (ans != -1) {
      for (int i = 1; i <= ans; i++) cout << s[i];
    } else
      cout << "Just a legend";
  }
  return 0;
}