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 MOD = 1791791791;
double eps = 1e-12;
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
template <typename T, typename U, typename V>
struct Triple {
  T first;
  U second;
  V third;
  Triple(T first, U second, V third)
      : first(first), second(second), third(third) {}
  Triple() {}
};
const long long p = 31, mod = 1791791791;
vector<long long> ps, h;
long long n;
long long subHash(long long l, long long r) {
  return (h[r + 1] - (h[l] * ps[r - l + 1]) % mod + mod) % mod;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  string s;
  cin >> s;
  n = s.size();
  ps.resize(n + 1);
  h.resize(n + 1);
  ps[0] = 1;
  h[0] = 0;
  for (long long i = 0; i < n; i++) {
    ps[i + 1] = (ps[i] * p) % mod;
    long long d = (s[i] - 'a' + 1);
    h[i + 1] = (h[i] * p + d) % mod;
  }
  vector<pair<long long, long long> > finds;
  for (long long i = 0; i < n - 1; i++) {
    if (h[i + 1] == subHash(n - i - 1, n - 1)) {
      finds.push_back({i + 1, h[i + 1]});
    }
  }
  long long l = -1, r = finds.size();
  long long ans = 0;
  while (l + 1 < r) {
    long long m = (l + r) / 2;
    bool done = false;
    long long need = finds[m].second;
    for (long long i = 1; i < n - finds[m].first; i++) {
      if (need == subHash(i, i + finds[m].first - 1)) {
        done = true;
      }
    }
    if (done) {
      l = m;
      ans = finds[m].first;
    } else {
      r = m;
    }
  }
  if (ans == 0) {
    cout << "Just a legend"
         << "\n";
  } else {
    cout << s.substr(0, ans) << "\n";
  }
}