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 xx[] = {0, 0, 1, -1, 1, -1, 1, -1};
int yy[] = {1, -1, 0, 0, 1, -1, -1, 1};
struct Point {
  double x, y;
};
char str[1000009];
int F[1000009];
inline long long MAX(long long a, long long b) { return (a > b) ? a : b; }
inline long long MIN(long long a, long long b) { return (a > b) ? b : a; }
inline double dis(Point a, Point b) {
  return ((a.x - b.x) * (a.x - b.x) + (a.y - b.y) * (a.y - b.y));
}
void FailureFun(char *P, int n) {
  int i, j;
  F[0] = 0;
  i = 1, j = 0;
  while (i < n) {
    if (P[i] == P[j])
      F[i] = j + 1, i++, j++;
    else if (j > 0)
      j = F[j - 1];
    else
      F[i] = 0, i++;
  }
}
int main() {
  int n, m, s, i, j, k, l = 0;
  while (gets(str)) {
    n = strlen(str);
    FailureFun(str, n);
    m = F[n - 1];
    s = 0;
    if (m == 0) {
      printf("Just a legend\n");
      continue;
    }
    if (2 * m > n)
      s = n - (2 * (n - m));
    else {
      for (i = n - 2; i >= 1; i--)
        if (F[i] <= m && s < F[i]) {
          for (l = n - 1, k = F[i] - 1, j = i; k >= 0; k--, j--, l--)
            if (str[k] != str[j] || str[l] != str[j]) break;
          if (k == -1) s = F[i];
        }
    }
    if (!s)
      printf("Just a legend\n");
    else {
      for (k = 0; k < s; k++) printf("%c", str[k]);
      printf("\n");
    }
  }
  return 0;
}