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 int N = 1e6 + 123;
const int mod = 1e9 + 8;
const int inf = 1e9 + 123;
const long long INF = 1e18 + 123;
const double eps = (double)(1e-9);
const double pi = 3.14159265358979323846264;
const int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
const int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};
const pair<int, int> dir[] = {make_pair(-1, 0), make_pair(0, -1),
                              make_pair(1, 0), make_pair(0, 1)};
const pair<int, int> dirr[] = {
    make_pair(-2, 1), make_pair(1, -2), make_pair(2, -1),  make_pair(-1, 2),
    make_pair(2, 1),  make_pair(1, 2),  make_pair(-2, -1), make_pair(-1, -2)};
string second;
long long p[N], h[N], pr = 31;
string ans;
long long get(long long i, long long j) {
  return (h[j] - (h[i] * p[j - i]) % mod + mod) % mod;
}
bool check(long long len) {
  long long i = len;
  long long j = second.size() - len + 1;
  long long x = h[i];
  long long y = get(j - 1, second.size());
  if (x != y) {
    return 0;
  }
  bool ok = 0;
  for (long long k = len + 1; k < second.size(); ++k) {
    long long z = get(k - len, k);
    if (x == z && y == z) {
      ok = 1;
      break;
    }
  }
  if (!ok) {
    return 0;
  }
  ans = "";
  for (long long i = 1; i <= len; ++i) {
    ans += second[i - 1];
  }
  return 1;
}
int main() {
  cin.tie(0);
  cout.tie(0);
  cout.precision(0);
  ios_base::sync_with_stdio(0);
  cin >> second;
  p[0] = 1;
  for (long long i = 1; i <= 1e6; ++i) {
    p[i] = (p[i - 1] * pr) % mod;
  }
  for (long long i = 1; i <= second.size(); ++i) {
    h[i] = (h[i - 1] * pr + second[i - 1]) % mod;
  }
  for (long long i = second.size(); i > 0; --i) {
    if (check(i)) {
      break;
    }
  }
  if (!ans.size()) {
    cout << "Just a legend";
    return 0;
  }
  cout << ans;
  return 0;
}