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;
const int maxn = 1e6 + 10;
char s[maxn];
int next_[maxn];
vector<int> v;
void getNext_(char *pattern, int plen) {
  int j, k;
  j = 0, k = -1;
  next_[0] = -1;
  while (j < plen) {
    if (j < plen - 1) {
      if (k == -1 || pattern[j] == pattern[k])
        next_[++j] = ++k;
      else
        k = next_[k];
    } else {
      if (k == -1)
        break;
      else if (pattern[j] == pattern[k]) {
        v.push_back(k + 1);
        k = next_[k];
      } else
        k = next_[k];
    }
  }
}
void getNext(char *pattern, int plen) {
  int j, k;
  j = 0, k = -1;
  next_[0] = -1;
  while (j < plen) {
    if (k == -1 || pattern[j] == pattern[k])
      next_[++j] = ++k;
    else
      k = next_[k];
  }
}
bool KMP_Index(char *str, char *pattern, int slen, int plen) {
  int i = 0, j = 0;
  getNext(pattern, plen);
  while (i < slen && j < plen) {
    if (j == -1 || str[i] == pattern[j])
      i++, j++;
    else
      j = next_[j];
  }
  if (j == plen)
    return true;
  else
    return false;
}
int main(int argc, char **argv) {
  scanf("%s", s);
  int len = strlen(s);
  getNext_(s, len);
  if (!v.size()) {
    printf("Just a legend\n");
    return 0;
  }
  for (int i = 0; i < v.size(); i++) {
    int sublen = v[i];
    if (KMP_Index(s + 1, s, len - 2, sublen)) {
      for (int i = 0; i < sublen; i++) printf("%c", s[i]);
      printf("\n");
      return 0;
    }
  }
  printf("Just a legend\n");
  return 0;
}