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;
string s, g;
int ck[1000010], ans;
int first[1000010];
vector<int> a[1000010];
void dfs(int i) {
  if (ck[first[i - 1]] && first[i - 1] <= s.size() - 2)
    ans = max(ans, first[i - 1]);
  for (auto p : a[i]) {
    dfs(p);
  }
}
int getNextLen(int len, char c) {
  while (len && s[len] != c) len = first[len - 1];
  if (s[len] == c) ++len;
  return len;
}
void computeF() {
  first[0] = 0;
  for (int i = 1; i < s.size(); ++i) first[i] = getNextLen(first[i - 1], s[i]);
}
int main() {
  cin >> s;
  if (s.size() < 3) {
    cout << "Just a legend";
    return 0;
  }
  computeF();
  for (int i = 1; i <= s.size() - 2; i++) {
    ck[first[i]] = 1;
  }
  for (int i = 0; i <= s.size() - 1; i++) a[i + 1].push_back(first[i]);
  dfs(s.size());
  if (ans == 0)
    cout << "Just a legend";
  else
    for (int i = s.size() - ans; i < s.size(); i++) cout << s[i];
  return 0;
}