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 pair<long long, long long> M = make_pair(1e9 + 7, 1e9 + 9);
const long long base = 347;
const int N = 1e6 + 7;
ostream& operator<<(ostream& os, pair<long long, long long> hash) {
  return os << "(" << hash.first << ", " << hash.second << ")";
}
pair<long long, long long> operator+(pair<long long, long long> a,
                                     long long x) {
  return make_pair(a.first + x, a.second + x);
}
pair<long long, long long> operator-(pair<long long, long long> a,
                                     long long x) {
  return make_pair(a.first - x, a.second - x);
}
pair<long long, long long> operator*(pair<long long, long long> a,
                                     long long x) {
  return make_pair(a.first * x, a.second * x);
}
pair<long long, long long> operator+(pair<long long, long long> a,
                                     pair<long long, long long> x) {
  return make_pair(a.first + x.first, a.second + x.second);
}
pair<long long, long long> operator-(pair<long long, long long> a,
                                     pair<long long, long long> x) {
  return make_pair(a.first - x.first, a.second - x.second);
}
pair<long long, long long> operator*(pair<long long, long long> a,
                                     pair<long long, long long> x) {
  return make_pair(a.first * x.first, a.second * x.second);
}
pair<long long, long long> operator%(pair<long long, long long> a,
                                     pair<long long, long long> m) {
  return make_pair(a.first % m.first, a.second % m.second);
}
pair<long long, long long> pb[N];
void hashPre() {
  pb[0] = make_pair(1, 1);
  for (int i = 1; i < N; i++) pb[i] = (pb[i - 1] * base) % M;
}
vector<pair<long long, long long> > hashList(string s) {
  int n = s.size();
  vector<pair<long long, long long> > ans(n + 1);
  ans[0] = make_pair(0, 0);
  for (int i = 1; i <= n; i++) ans[i] = (ans[i - 1] * base + s[i - 1]) % M;
  return ans;
}
pair<long long, long long> substringHash(
    const vector<pair<long long, long long> >& hashlist, int l, int r) {
  int len = (r - l + 1);
  return ((hashlist[r] - hashlist[l - 1] * pb[len]) % M + M) % M;
}
vector<int> prefix_function(string s) {
  int n = s.size();
  vector<int> pi(n);
  for (int i = 1; i < n; i++) {
    int j = pi[i - 1];
    while (j > 0 and s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) ++j;
    pi[i] = j;
  }
  return pi;
}
int main() {
  hashPre();
  string a;
  vector<pair<long long, long long> > ha;
  int n;
  cin >> a;
  ha = hashList(a);
  n = a.size();
  vector<long long> vv;
  for (int i = 1; i < n; i++) {
    if (substringHash(ha, 1, i) == substringHash(ha, n - i + 1, n))
      vv.emplace_back(i);
  }
  sort(vv.begin(), vv.end());
  vector<int> vv1 = prefix_function(a);
  int ans = 0;
  for (int i = 1; i < n - 1; i++)
    if (binary_search(vv.begin(), vv.end(), vv1[i])) ans = max(ans, vv1[i]);
  if (ans) {
    for (int i = 0; i < ans; i++) cout << a[i];
  } else
    cout << "Just a legend";
}