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;
void lps(string s, int *a) {
  long long int n = s.length();
  long long int i = 1;
  long long int len = 0;
  a[0] = 0;
  while (i < n) {
    if (s[i] == s[len]) {
      len++;
      a[i] = len;
      i++;
    } else {
      if (len != 0) {
        len = a[len - 1];
      } else {
        a[i] = 0;
        i++;
      }
    }
  }
}
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  int a[n];
  lps(s, a);
  set<int> unq;
  for (int i = 0; i < n - 1; i++) unq.insert(a[i]);
  int i = a[n - 1];
  int flag = 0;
  while (i != 0) {
    if (unq.find(i) != unq.end() && s[i - 1] == s[n - 1]) {
      flag = 1;
      break;
    }
    i = a[i - 1];
  }
  if (flag)
    cout << s.substr(0, i) << endl;
  else
    cout << "Just a legend" << endl;
}
int main() { solve(); }