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 long MOD = 1e9 + 7;
const long long P = 29;
const int N = 1e6 + 5;
string s;
int n;
long long hsh[N], inv[N];
vector<int> L;
long long bpow(long long a, long long b) {
  long long ans = 1LL;
  while (b) {
    if (b & 1) ans = ans * a;
    a *= a;
    if (ans >= MOD) ans %= MOD;
    if (a >= MOD) a %= MOD;
    b >>= 1LL;
  }
  return ans;
}
long long GetHash(int fi, int se) {
  if (!fi) return hsh[se];
  return (hsh[se] - hsh[fi - 1] + MOD) % MOD * inv[fi] % MOD;
}
void print(int i, int j) {
  for (int k = i; k <= j; k++) cout << s[k];
}
bool solve(int mid, long long h1) {
  for (int i = 1; i + mid - 1 < n - 1; i++) {
    if (GetHash(i, i + mid - 1) == h1) {
      return true;
    }
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> s;
  n = s.length();
  long long p = 1LL;
  for (int i = 1; i < n; i++) {
    p *= P;
    if (p >= MOD) p %= MOD;
  }
  inv[n - 1] = bpow(p, MOD - 2);
  for (int i = n - 2; i >= 0; i--) {
    inv[i] = inv[i + 1] * P % MOD;
    if (inv[i] >= MOD) inv[i] %= MOD;
  }
  p = P;
  hsh[0] = s[0] - 'a' + 1;
  for (int i = 1; i < n; i++) {
    hsh[i] = (hsh[i - 1] + p * (s[i] - 'a' + 1)) % MOD;
    p *= P;
    if (p >= MOD) p %= MOD;
  }
  long long h1, h2;
  for (int len = 0; len < n - 1; len++) {
    h1 = GetHash(0, len);
    h2 = GetHash(n - 1 - len, n - 1);
    if (h1 == h2) {
      L.push_back(len + 1);
    }
  }
  if (L.size() == 0) {
    cout << "Just a legend";
    return 0;
  }
  int le = 0;
  int ri = L.size() - 1;
  int ans = -1;
  while (le <= ri) {
    int mid = (le + ri) >> 1;
    if (solve(L[mid], GetHash(0, L[mid] - 1))) {
      ans = L[mid];
      le = mid + 1;
    } else {
      ri = mid - 1;
    }
  }
  if (ans != -1) {
    for (int i = 0; i < ans; i++) cout << s[i];
  } else
    cout << "Just a legend";
  return 0;
}