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;
char save[1000010];
int pre[1000010];
char tmp[1000010];
int tpre[1000010];
void gpre(char *s, int *p) {
  int i, j;
  int len = strlen(s);
  p[0] = -1;
  j = -1;
  for (i = 0; i < len && j < len;) {
    if (j == -1 || s[i] == s[j]) {
      p[++i] = ++j;
    } else {
      j = p[j];
    }
  }
}
int find(char *s, char *x, int *p) {
  int i, j;
  i = j = 0;
  int len = strlen(x);
  int length = strlen(s);
  while (i < length && j < len) {
    if (j == -1 || s[i] == x[j]) {
      i++;
      j++;
    } else {
      j = p[j];
    }
  }
  if (j == len) {
    return i - len;
  }
  return -1;
}
int main() {
  while (scanf("%s", save) != EOF) {
    gpre(save, pre);
    int len = strlen(save);
    if (len == 0) {
      printf("Just a legend\n");
      break;
    }
    int e = pre[len];
    int res = -1;
    while (e) {
      sprintf(tmp, "%s", save + len - e);
      gpre(tmp, tpre);
      int tres = find(save + 1, tmp, tpre);
      if (tres + 1 + e < len) {
        res = tres + 1;
        break;
      }
      e = pre[e];
    }
    if (res != -1) {
      printf("%s\n", save + len - e);
    } else {
      printf("Just a legend\n");
    }
  }
  return 0;
}