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 long double eps = 1E-2;
const int pinf = 1E+9;
const int minf = 1E-9;
template <typename T>
inline T sqr(T _k) {
  return _k * _k;
}
vector<int> z_f;
void z_function(string &s);
int main(int argc, char **argv) {
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  z_function(s);
  int ans = 0, max = 0;
  for (int i = 1; i < s.length(); ++i) {
    if (z_f[i] == s.length() - i && max >= s.length() - i) {
      ans = s.length() - i;
      break;
    }
    max = std::max(max, z_f[i]);
  }
  cout << (ans == 0 ? "Just a legend" : s.substr(0, ans)) << endl;
  return 0;
}
void z_function(string &s) {
  z_f = vector<int>(s.length());
  for (int i = 1, l = 0, r = 0; i < s.length(); ++i) {
    if (i <= r) z_f[i] = min(r - i + 1, z_f[i - l]);
    while (i + z_f[i] < s.length() && s[i + z_f[i]] == s[z_f[i]]) ++z_f[i];
    if (i + z_f[i] - 1 > r) l = i, r = i + z_f[i] - 1;
  }
}