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>
char str[1000005];
int z[1000005];
int len, answer;
void CalcZArrayN2() {
  for (int i = 1; i < len; i++) {
    while ((i + z[i] < len) && (str[i + z[i]] == str[z[i]])) {
      z[i]++;
    }
  }
}
inline int max(int a, int b) { return a > b ? a : b; }
inline int min(int a, int b) { return a < b ? a : b; }
void CalcZArrayLinear() {
  int l = 0, r = 0;
  for (int i = 1; i < len; i++) {
    if (i <= r) {
      z[i] = min(r - i + 1, z[i - l]);
    }
    while ((i + z[i] < len) && (str[i + z[i]] == str[z[i]])) {
      z[i]++;
    }
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
}
void ReadData() {
  memset(str, 0, sizeof(char) * 1000005);
  memset(z, 0, sizeof(int) * 1000005);
  scanf("%s\n", &str);
}
void Solve() {
  len = strlen(str);
  answer = -1;
  if (len < 3) return;
  CalcZArrayLinear();
  int maxz = 0;
  for (int i = 1; i < len; i++) {
    if (z[i] == len - i && maxz >= len - i) {
      answer = len - i;
      break;
    }
    maxz = max(maxz, z[i]);
  }
}
void WriteData() {
  if (answer == -1) {
    printf("Just a legend");
  } else {
    for (int i = 0; i < answer; i++) {
      printf("%c", str[i]);
    }
  }
  printf("\n");
}
int main() {
  int QWE;
  QWE = 1;
  for (int T = 0; T < QWE; T++) {
    ReadData();
    Solve();
    WriteData();
  }
  return 0;
}