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 double PI = acos(-1);
const double EPS = 1e-7;
const int MOD = 1e9 + 7;
const int INF = 2e9 + 7;
const long long INFL = 8e18L + 7;
bool debug = 0;
void run();
int main() {
  string file_name = "";
  if (file_name != "") {
    freopen((file_name + ".in").c_str(), "r", stdin);
    freopen((file_name + ".out").c_str(), "w", stdout);
  }
  run();
  return 0;
}
const int N = 1e6 + 7;
int n;
const int AMN = 3;
const long long MODS[AMN] = {1000000003, 1000000007, 1000000009};
const long long PS[AMN] = {29, 31, 37};
long long KS[AMN][N];
long long HS[AMN][N];
vector<int> gethash(int i, int len) {
  vector<int> ret(AMN);
  for (int h = 0; h < AMN; h++)
    ret[h] = (int)((HS[h][i + len - 1] - HS[h][i - 1] + MODS[h]) % MODS[h] *
                   KS[h][n - i] % MODS[h]);
  return ret;
}
bool check(int len) {
  vector<int> h1 = gethash(1, len);
  vector<int> h2 = gethash(n - len + 1, len);
  if (h1 == h2)
    for (int i = 2; i <= n - len; i++)
      if (gethash(i, len) == h1) return 1;
  return 0;
}
void run() {
  string s;
  cin >> s;
  n = s.length();
  s = " " + s;
  for (int h = 0; h < AMN; h++) KS[h][0] = 1;
  for (int h = 0; h < AMN; h++)
    for (int i = 1; i <= n; i++) KS[h][i] = (KS[h][i - 1] * PS[h]) % MODS[h];
  for (int h = 0; h < AMN; h++)
    for (int i = 1; i <= n; i++)
      HS[h][i] = (HS[h][i - 1] + (s[i] - 'a' + 1) * KS[h][i]) % MODS[h];
  for (int l = n; l > 0; l--)
    if (check(l)) {
      cout << s.substr(1, l) << endl;
      return;
    }
  cout << "Just a legend" << endl;
}