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 z[1000006], dp[1000006];
int N;
char ch[1000006];
void zee() {
  int L, R, k, a, ans;
  z[0] = 0;
  L = R = -1;
  for (a = 1; a < N; a++) {
    if (a > R) {
      L = R = a;
      while (ch[R - L] == ch[R]) R++;
      z[a] = R - L;
      R--;
    } else {
      k = a - L;
      if (z[k] < R - a + 1) {
        z[a] = z[k];
      } else {
        L = a;
        while (ch[R - L] == ch[R]) R++;
        z[a] = R - L;
        R--;
      }
    }
  }
  L = -1;
  ans = 0;
  for (a = N - 1; a >= 0; a--) {
    if (z[a] == N - a)
      dp[a] = z[a];
    else
      dp[a] = dp[a + 1];
  }
  for (a = 1; a < N; a++) {
    if (z[a] > 0) {
      if (ans < min(z[a], dp[a + 1]) && z[a] >= dp[a + 1]) {
        ans = min(z[a], dp[a + 1]);
        L = a;
      }
    }
  }
  if (L == -1)
    printf("Just a legend\n");
  else {
    for (a = 0; a < ans; a++) printf("%c", ch[L + a]);
    printf("\n");
  }
}
int main() {
  gets(ch);
  N = strlen(ch);
  zee();
  return 0;
}