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> longestPrefix(1000001);
void computePrefix(string str) {
  longestPrefix.push_back(0);
  long long m = str.length();
  for (long long i = 1, k = 0; i < m; i++) {
    while (k > 0 && str[k] != str[i]) {
      k = longestPrefix[k - 1];
    }
    if (str[k] == str[i]) {
      longestPrefix[i] = ++k;
    } else {
      longestPrefix[i] = k;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  computePrefix(s);
  long long found = 0;
  long long len;
  len = longestPrefix[s.length() - 1];
  if (len != 0) {
    for (long long j = 0; j < 2; j++) {
      for (long long i = 1; i < s.length() - 1; i++) {
        if (len == longestPrefix[i]) {
          found = 1;
          break;
        }
      }
      if (!found) {
        len = longestPrefix[len - 1];
        if (len == 0) break;
      } else
        break;
    }
  }
  if (!found || len == 0) {
    cout << "Just a legend";
  } else {
    cout << s.substr(0, len);
  }
}