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> getZ(string &s) {
  int n = s.length();
  vector<int> z(n);
  int l = -1;
  int r = -1;
  for (int i = 1; i < n - 1 + 1; ++i) {
    if (r > i) {
      z[i] = min(z[i - l], r - i + 1);
    }
    while (i + z[i] < n && s[i + z[i]] == s[z[i]]) z[i]++;
    if (i + z[i] > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
  return z;
}
int main() {
  ios_base::sync_with_stdio(false);
  string s;
  cin >> s;
  ;
  int n = s.length();
  auto z = getZ(s);
  int longestInfix = 0;
  for (int i = 1; i < n - 1 + 1; ++i)
    if (z[i] > 0) {
      longestInfix = max(longestInfix, min(n - i - 1, z[i]));
    };
  pair<int, int> bestMatch = make_pair(0, 0);
  for (int i = 1; i < n - 1 + 1; ++i)
    if (i + z[i] - 1 == n - 1 && z[i] <= longestInfix) {
      { bestMatch = max(bestMatch, make_pair(z[i], i)); };
    }
  if (bestMatch.first == 0)
    cout << "Just a legend";
  else {
    for (int i = 0; i < bestMatch.first - 1 + 1; ++i)
      cout << s[bestMatch.second + i];
  }
}