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 main() {
  cin >> s;
  int n = s.length();
  int l[n];
  int i = 1;
  int len = 0;
  l[0] = 0;
  while (i < n) {
    if (s[i] == s[len]) {
      len++;
      l[i] = len;
      i++;
    } else {
      if (len == 0) {
        l[i] = 0;
        i++;
      } else {
        len = l[len - 1];
      }
    }
  }
  if (l[n - 1] == 0 || n < 3) {
    cout << "Just a legend";
    exit(0);
  }
  if (l[n - 1] == n - 1) {
    cout << s.substr(0, n - 2);
    exit(0);
  }
  i = n;
  while (l[i - 1] != 0) {
    i = l[i - 1];
    int z = 0;
    int p = 0, q = 0;
    string ans = s.substr(0, i);
    while (p < n) {
      if (s[p] == ans[q]) p++, q++;
      if (q == i) z++, q = l[q - 1];
      if (p < n && q < i && s[p] != ans[q]) {
        if (q != 0)
          q = l[q - 1];
        else
          p++;
      }
    }
    if (z > 2) {
      cout << ans;
      exit(0);
    }
  }
  cout << "Just a legend";
}