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 mod = 1e9 + 7;
const int maxn = 1e6 + 10;
const int b = 256;
string s;
long long int ph[maxn];
long long int pw[maxn];
inline long long int get(int l, int r);
inline bool check(int f);
vector<int> v;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  pw[0] = 1;
  for (int i = 0; i < s.size(); i++) {
    ph[i + 1] = (ph[i] * b + s[i]) % mod;
    pw[i + 1] = (b * pw[i]) % mod;
  }
  for (int i = 0; i < s.size() - 1; i++) {
    if (get(1, i + 1) == get(s.size() - i, s.size())) {
      v.push_back(i + 1);
    }
  }
  sort(v.begin(), v.end());
  if (v.size() == 0) {
    cout << "Just a legend";
    return 0;
  } else if (check(v[v.size() - 1]) == true) {
    for (int i = 0; i < v[v.size() - 1]; i++) {
      cout << s[i];
    }
  } else {
    if (v.size() == 1) {
      cout << "Just a legend";
      return 0;
    } else {
      for (int i = 0; i < v[v.size() - 2]; i++) {
        cout << s[i];
      }
    }
  }
  return 0;
}
inline long long int get(int l, int r) {
  return ((ph[r] - ((ph[l - 1] * pw[r - l + 1]) % mod)) + mod) % mod;
}
inline bool check(int f) {
  for (int i = 2; i <= s.size() - f; i++) {
    if (get(i, i + f - 1) == get(1, f)) {
      return true;
    }
  }
  return false;
}