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;
string s;
int lps[1000000] = {0};
bool search(int l, int r) {
  int start = 1, end = s.size() - 2;
  int pos = l;
  while (start <= end) {
    if (s[start] == s[l]) {
      start++;
      l++;
      if (l == r) return true;
    } else {
      if (l == 0)
        start++;
      else
        l = lps[l - 1];
    }
  }
  return false;
}
int main() {
  cin >> s;
  int n = s.size();
  int i = 1, k = 0;
  while (i < n) {
    if (s[k] == s[i]) {
      lps[i] = k + 1;
      k = lps[i];
      i++;
    } else {
      if (k == 0) {
        lps[i] = 0;
        i++;
      } else
        k = lps[k - 1];
    }
  }
  int len = lps[n - 1];
  while (len != 0) {
    if (search(0, len)) {
      break;
    }
    len = lps[len - 1];
  }
  if (len == 0) {
    cout << "Just a legend" << endl;
    return 0;
  }
  for (int i = 0; i < len; i++) cout << s[i];
  cout << endl;
  return 0;
}