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 long double eps = 1e-16;
const int MOD = (int)1e9 + 9;
const long long INF = (int)1e9 + 10;
const int NHASH = 2;
template <typename T>
vector<T> readVector0(int n) {
  vector<T> res(n);
  for (int i = 0; i < n; i++) cin >> res[i];
  return res;
}
template <typename T>
vector<T> readVector1(int n) {
  vector<T> res(n + 1);
  for (int i = 1; i <= n; i++) cin >> res[i];
  return res;
}
inline long long mod(long long first, long long m = MOD) {
  if (first < 0) first += m;
  return (first % m);
}
template <typename T>
bool sortBy2(const pair<T, T> &a, const pair<T, T> &b) {
  return (a.second < b.second);
}
int n;
vector<long long> p_pow[NHASH];
int p[NHASH];
vector<long long> hp[NHASH];
vector<long long> hs[NHASH];
vector<int> pi;
string s;
long long binPow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = mod(res * a);
    a = mod(a * a);
    b >>= 1;
  }
  return res;
}
void getPrefHash(const string &s) {
  for (int k = 0; k < NHASH; k++) {
    p_pow[k] = vector<long long>(n);
    p_pow[k][0] = 1;
    for (int i = 1; i < n; i++) p_pow[k][i] = (p_pow[k][i - 1] * p[k]) % MOD;
    hp[k] = vector<long long>(n + 1, 0);
    for (int i = 0; i < n; i++)
      hp[k][i + 1] = (hp[k][i] + (s[i] - 'a' + 1) * p_pow[k][i]) % MOD;
  }
}
bool checkHashes(const string &s, int i, int j) {
  for (int k = 0; k < NHASH; k++) {
    if (mod(hp[k][i] * binPow(p[k], (j - 1))) != hs[k][j]) return false;
  }
  return true;
}
void prefixFunction(const string &s) {
  for (int i = 1; i < n; i++) {
    int j = pi[i - 1];
    while (j > 0 && s[i] != s[j]) j = pi[j - 1];
    if (s[i] == s[j]) j++;
    pi[i] = j;
  }
}
int main() {
  auto seed = chrono::duration_cast<chrono::nanoseconds>(
                  chrono::steady_clock::now().time_since_epoch())
                  .count();
  mt19937 mt(seed);
  for (int k = 0; k < NHASH; k++) {
    p[k] = uniform_int_distribution<int>(31, MOD - 1)(mt);
  }
  cin >> s;
  n = s.size();
  pi = vector<int>(n, 0);
  getPrefHash(s);
  for (int k = 0; k < NHASH; k++) {
    hs[k] = vector<long long>(n + 1, 0);
    for (int i = 1; i <= n; ++i)
      hs[k][i] = (hp[k][n] - hp[k][i - 1] + MOD) % MOD;
  }
  prefixFunction(s);
  int m_l = 0;
  for (int i = 0; i < n - 1; ++i) {
    if (pi[i] > m_l && checkHashes(s, pi[i], n + 1 - pi[i])) {
      m_l = pi[i];
    }
  }
  if (m_l == 0) {
    cout << "Just a legend";
    return 0;
  }
  cout << s.substr(0, m_l);
  return 0;
}