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;
int arr[1000001];
void preKmp(string x, int m) {
  int i, j;
  i = 0;
  j = -1;
  arr[0] = -1;
  while (i < m) {
    while (j > -1 && x[i] != x[j]) j = arr[j];
    i++;
    j++;
    arr[i] = j;
  }
}
int KMP(string x, int m, string y, int n, int k) {
  int i, j, ans = 0;
  i = j = 0;
  while (j < n) {
    while (i > -1 && x[i] != y[j]) i = arr[i];
    i++;
    j++;
    if (i == k) {
      ans++;
      i = arr[i];
    }
  }
  return (ans > 2);
}
string solve(string txt) {
  int n = txt.length();
  string ans;
  if (n < 3) {
    ans = "Just a legend";
    return ans;
  }
  preKmp(txt, n);
  int last = arr[n];
  if (last == 0) {
    ans = "Just a legend";
    return ans;
  }
  if (KMP(txt, n, txt, n, last)) {
    ans = txt.substr(0, last);
  } else if (arr[last] > 0) {
    ans = txt.substr(0, arr[last]);
  } else {
    ans = "Just a legend";
  }
  return ans;
}
int main() {
  string txt;
  cin >> txt;
  cout << solve(txt);
  return 0;
}