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>
#pragma warning(disable : 4786)
#pragma comment(linker, "/STACK:16777216")
using namespace std;
char str[1000005];
int Z[1000005], n;
void Zfunction() {
  int L, R, r, i, j, k;
  L = 0;
  R = 0;
  Z[0] = 0;
  for (i = 1; i < n; i++) {
    if (i > R) {
      L = i;
      R = i;
      while (R < n && str[R - L] == str[R]) R++;
      Z[i] = R - L;
      R--;
    } else {
      r = i - L;
      if (Z[r] < R - i + 1)
        Z[i] = Z[r];
      else {
        L = i;
        while (R < n && str[R - L] == str[R]) R++;
        Z[i] = R - L;
        R--;
      }
    }
  }
}
int max(int a, int b) {
  if (a > b) return a;
  return b;
}
int main() {
  int i, j, k, maxr, res;
  while (scanf("%s", str) != EOF) {
    n = strlen(str);
    maxr = 0;
    res = 0;
    Zfunction();
    for (i = 0; i < n; i++) {
      if (Z[i] == n - i) {
        if (maxr >= n - i) {
          res = n - i;
          break;
        }
      }
      maxr = max(maxr, Z[i]);
    }
    if (res == 0 || n <= 2)
      printf("Just a legend\n");
    else {
      for (i = 0; i < res; i++) printf("%c", str[i]);
      printf("\n");
    }
  }
  return 0;
}