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 + 10;
int p[N], d[N], ans;
string s;
void prefix(string s) {
  int j = 0;
  for (int i = 1; i < (int)s.size(); i++) {
    while (j > 0 && s[i] != s[j]) j = p[j - 1];
    j += (s[i] == s[j]);
    p[i] = j;
  }
}
int main() {
  cin >> s;
  if (s.size() < 3) {
    cout << "Just a legend";
    return 0;
  }
  prefix(s);
  if (p[s.size() - 1] == 0) {
    cout << "Just a legend";
    return 0;
  }
  for (int i = 0; i < s.size(); i++) d[p[i]]++;
  if (d[p[s.size() - 1]] >= 2) ans = p[s.size() - 1];
  if (ans == 0) {
    int pos = s.size() - 1;
    while (pos - 1 > 0 && p[pos - 1] > 0) pos--;
    string t = s.substr(pos, s.size() - pos);
    for (int i = 0; i <= s.size(); i++) d[i] = 0;
    prefix(t);
    for (int i = 0; i < t.size(); i++) d[p[i]]++;
    if (d[p[t.size() - 1]] >= 1) ans = p[t.size() - 1];
    if (ans != 0) {
      string t1 = s.substr(0, ans);
      string t2 = s.substr(s.size() - ans, ans);
      if (t1 == t2)
        cout << t1;
      else
        cout << "Just a legend";
    } else
      cout << "Just a legend";
  } else
    for (int i = 0; i < ans; i++) cout << s[i];
  return 0;
}