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_algo(char* s, int** zz);
int main() {
  int TC = 1;
  int* z;
  while (TC--) {
    char a[1000001];
    char g[1000001 * 2];
    strcpy(a, "");
    strcpy(g, "");
    scanf("%s", a);
    strcat(g, a);
    strcat(g, "$");
    strcat(g, a);
    z_algo(g, &z);
    int lenG = strlen(g);
    int lenA = strlen(a);
    int i = 0;
    int res = 0;
    for (i = lenA + 2; i < lenG; i++) {
      if (z[i] > 0) {
        if (z[res] < z[i]) {
          res = i;
        }
      }
    }
    if (z[res] > 0) {
      for (i = res + 1; i < lenG; i++) {
        if (z[i] <= z[res] && i + z[i] == lenG) {
          printf("%s\n", g + i);
          break;
        }
      }
    }
    if (i == lenG) {
      printf("Just a legend\n");
    }
  }
  return 0;
}
int z_algo(char* s, int** zz) {
  int result = 0;
  int len = strlen(s);
  result = len;
  int* z = (int*)calloc(len, sizeof(int));
  *zz = z;
  int r = 0, l = 0, i = 0, j = 0, _k = 0, _b = 0;
  for (int k = 1; k < len; k++) {
    if (k > r) {
      i = 0;
      j = k;
      while (j < len && s[i] == s[j]) {
        i++;
        j++;
      }
      if (j - k > 0) {
        l = k;
        r = j - 1;
        z[k] = j - k;
      }
    } else {
      _k = k - l;
      _b = r - k + 1;
      if (z[_k] < _b) {
        z[k] = z[_k];
      } else {
        i = _b;
        j = r + 1;
        while (j < len && s[i] == s[j]) {
          i++;
          j++;
        }
        if (j >= r + 1) {
          l = k;
          r = j - 1;
          z[k] = j - k;
        }
      }
    }
    result += z[k];
  }
  return result;
}