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;
int ans;
string s;
void Z_value(string& s, vector<int>& z) {
  z.resize(s.size());
  int i, j, left, right, len = s.size();
  left = right = 0;
  z[0] = len;
  for (i = 1; i < (int)s.size(); ++i) {
    j = max(min(z[i - left], right - i), 0);
    for (; i + j < len && s[i + j] == s[j]; ++j)
      ;
    z[i] = j;
    if (i + z[i] > right) {
      left = i;
      right = i + z[i];
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> s;
  vector<int> z;
  Z_value(s, z);
  int maxz = 0;
  for (int i = 1; i < (int)s.size(); ++i) {
    if (z[i] == (int)s.size() - i and maxz >= (int)s.size() - i) {
      ans = s.size() - i;
      break;
    }
    maxz = max(maxz, z[i]);
  }
  if (ans == 0)
    cout << "Just a legend" << '\n';
  else
    cout << s.substr(0, ans) << '\n';
}