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;
#pragma comment(linker, "/STACK:102400000")
char s[1000009];
int m, n, Next[1000009], ret[1000009], f[1000009];
void exkmp(char *a, char *b, int m, int n) {
  int i, j, k;
  for (j = 0; j + 1 < m && a[j] == a[j + 1]; j++)
    ;
  Next[1] = j;
  k = 1;
  for (i = 2; i < m; i++) {
    int len = k + Next[k], l = Next[i - k];
    if (l < len - i)
      Next[i] = l;
    else {
      for (j = max(0, len - i); i + j < m && a[j] == a[i + j]; j++)
        ;
      Next[i] = j;
      k = i;
    }
  }
  for (j = 0; j < n && j < m && a[j] == b[j]; j++)
    ;
  ret[0] = j;
  k = 0;
  for (i = 1; i < n; i++) {
    int len = k + ret[k], l = Next[i - k];
    if (l < len - i)
      ret[i] = l;
    else {
      for (j = max(0, len - i); j < m && i + j < n && a[j] == b[i + j]; j++)
        ;
      ret[i] = j;
      k = i;
    }
  }
}
bool is(char *s, int m, int n) {
  for (int i = 0; i < n; i++)
    if (ret[i] >= m) return 1;
  return 0;
}
int main() {
  while (scanf("%s", s) != EOF) {
    int len = strlen(s);
    f[0] = f[1] = 0;
    for (int i = 1; i < len; i++) {
      int j = f[i];
      while (j && s[j] != s[i]) j = f[j];
      if (s[j] == s[i])
        f[i + 1] = j + 1;
      else
        f[i + 1] = 0;
    }
    m = f[len];
    n = len - 2;
    if (len % (len - m) == 0) m = f[m];
    exkmp(s, s + 1, m, n);
    bool flag = 0;
    while (1) {
      if (!m) break;
      if (is(s + 1, m, n)) {
        flag = 1;
        for (int i = 0; i < m; i++) printf("%c", s[i]);
        printf("\n");
        break;
      }
      m = f[m];
    }
    if (!flag) printf("Just a legend\n");
  }
}