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;
vector<int> fail(const string &s) {
  int n = s.length();
  vector<int> v(n + 1, 0);
  int tmp = 0;
  for (int i = 1; i < n; i++) {
    while (tmp && s[tmp] != s[i]) tmp = v[tmp];
    if (s[tmp] == s[i]) tmp++;
    v[i + 1] = tmp;
  }
  return v;
}
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  vector<int> v = fail(s);
  if (v[n] == 0)
    cout << "Just a legend";
  else {
    int f = 0;
    for (int i = 1; i < n; i++) {
      if (v[i] == v[n]) {
        f = v[i];
        break;
      }
    }
    if (f) {
      for (int i = 0; i < f; i++) cout << s[i];
    } else if (v[v[n]] == 0)
      cout << "Just a legend";
    else
      for (int i = 0; i < v[v[n]]; i++) cout << s[i];
  }
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int t = 1;
  solve();
}