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 inf = 1e18;
const long long N = 100001;
long long mod = 1000000007;
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
long long max(long long a, long long b) {
  if (a > b)
    return a;
  else
    return b;
}
long long power(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long p, long long q) {
  if (p % q == 0)
    return q;
  else {
    return gcd(q, p % q);
  }
}
long long mul(long long a, long long b) {
  return ((a % mod) * (b % mod)) % mod;
}
long long sub(long long a, long long b) {
  return (((a - b) % mod) + mod) % mod;
}
vector<long long> kmp(string s) {
  long long n = s.size();
  vector<long long> ans(n);
  long long len = 0;
  for (long long i = 1; i < n; i++) {
    while (len > 0 && s[len] != s[i]) len = ans[len - 1];
    len += (s[i] == s[len]);
    ans[i] = len;
  }
  return ans;
}
void solve() {
  string s;
  cin >> s;
  vector<long long> ans = kmp(s);
  if (ans.back() == 0) {
    cout << "Just a legend" << '\n';
    return;
  }
  for (long long i = 1; i < s.size() - 1; i++) {
    if (ans[i] == ans.back()) {
      cout << s.substr(0, ans[i]);
      cout << '\n';
      return;
    }
  }
  if (ans[ans.back() - 1] == 0)
    cout << "Just a legend";
  else
    cout << s.substr(0, ans[ans.back() - 1]);
}
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  for (long long i = 0; i < t; i++) {
    solve();
  }
  return 0;
}