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 next_function(char S[], int n, int next[]) {
  next[0] = n;
  int j = 0, k = 1;
  while (1 + j < n && S[j] == S[1 + j]) j++;
  next[1] = j;
  for (int i = 2; i < n; ++i) {
    int len = k + next[k] - 1;
    int l = next[i - k];
    if (l < len - i + 1)
      next[i] = l;
    else {
      int j = max(0, len - i + 1);
      while (S[i + j] == S[j] && i + j < n) j++;
      next[i] = j;
      k = i;
    }
  }
}
void extend_kmp(char S[], int n, char T[], int m, int next[], int lcp[]) {
  next_function(T, m, next);
  int j = 0, k = 0;
  while (j < min(n, m) && T[j] == S[j]) ++j;
  lcp[0] = j;
  for (int i = 1; i < n; ++i) {
    int len = k + lcp[k] - 1;
    int l = next[i - k];
    if (l < len - i + 1)
      lcp[i] = l;
    else {
      int j = max(0, len - i + 1);
      while (i + j < n && j < m && S[i + j] == T[j]) j++;
      lcp[i] = j;
      k = i;
    }
  }
}
char s[1000007];
int len, lcp[1000007];
int main() {
  scanf("%s", s);
  len = strlen(s);
  next_function(s, len, lcp);
  int x = 0;
  for (int i = 1; i < len; ++i)
    if (lcp[i] == len - i)
      x = max(x, lcp[i] - 1);
    else
      x = max(x, lcp[i]);
  int ans = 0;
  for (int i = 1; i < len; ++i)
    if (lcp[i] == len - i)
      if (lcp[i] <= x) ans = max(ans, lcp[i]);
  if (!ans)
    cout << "Just a legend\n";
  else
    cout << string(s, 0, ans) << endl;
  return 0;
}