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 LINF = 1e18 + 100100, INF = 2e9 + 100100;
const double EPS = 1e-9, PI = acos(-1);
const int MOD = 1e9 + 7, P = 239, MAXN = 1e5 + 100;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<int> zfunc(const string &s) {
  int n = (int)(s).size();
  vector<int> z(n);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) {
      z[i] = min(r - i, z[i - l]);
    }
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) {
      ++z[i];
    }
    if (i + z[i] > r) {
      l = i, r = i + z[i];
    }
  }
  return z;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long double START_TIME = clock();
  string s;
  cin >> s;
  int n = (int)(s).size();
  vector<int> z = zfunc(s);
  int limit = -1;
  for (int i = 0; i < n; ++i) {
    if (i + z[i] < n) {
      limit = max(limit, z[i]);
    } else {
      limit = max(limit, z[i] - 1);
    }
  }
  for (int i = 0; i < n; ++i) {
    if (i + z[i] == n) {
      if (limit >= z[i]) {
        cout << s.substr(0, z[i]);
        return 0;
      }
    }
  }
  cout << "Just a legend";
  long double WORK_TIME = (clock() - START_TIME) / CLOCKS_PER_SEC;
  if (false) cerr << "\n[" << ("WORK_TIME") << "]: " << (WORK_TIME);
  ;
  return 0;
}