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;
long double PI = 3.14159265358979323846;
const long long modo = 998244353;
const long long inf = 1e16;
const long long ms = (1e6) + 5;
char ar[ms];
int tt[ms] = {0};
set<int> ss;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  string s;
  cin >> s;
  int n = s.length();
  int i;
  int pr = 0;
  for (i = 1; i < n; i++) {
    while (pr > 0 && s[pr] != s[i]) {
      pr = tt[pr - 1];
    }
    if (s[i] == s[pr]) {
      pr++;
    }
    tt[i] = pr;
  }
  ss.insert(0);
  for (i = 1; i < (n - 1); i++) {
    ss.insert(tt[i]);
  }
  pr = tt[n - 1];
  while (!ss.count(pr)) {
    pr = tt[pr - 1];
  }
  if (!pr) {
    cout << "Just a legend";
    return 0;
  }
  for (i = 0; i < pr; i++) cout << s[i];
  return 0;
}