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>
int diru[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dirv[] = {-1, 0, 1, -1, 1, -1, 0, 1};
using namespace std;
template <class T>
T sq(T n) {
  return n * n;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
bool inside(T a, T b, T c) {
  return a <= b && b <= c;
}
template <class T>
void setmax(T &a, T b) {
  if (a < b) a = b;
}
template <class T>
void setmin(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
T power(T N, T P) {
  return (P == 0) ? 1 : N * power(N, P - 1);
}
bool dp1[1000010];
bool dp2[1000010];
char A[1000010];
char B[1000010];
int pre[1000010];
int n;
void prefixFunc(char *P, int lp) {
  pre[0] = 0;
  int i, k;
  for (i = 1; i < lp; i++) {
    k = pre[i - 1];
    while (1) {
      if (P[i] == P[k]) break;
      if (k == 0) {
        k--;
        break;
      }
      k = pre[k - 1];
    }
    pre[i] = k + 1;
  }
}
void fil(bool *dp, int k) {
  while (1) {
    if (dp[k]) return;
    dp[k] = 1;
    if (k == 0) return;
    k = pre[k - 1];
  }
}
void kmp1() {
  int k = 0, i;
  if (A[0] == B[0]) k++;
  for (i = 1; i < n; i++) {
    while (1) {
      if (A[i] == B[k]) break;
      if (k == 0) {
        k--;
        break;
      }
      k = pre[k - 1];
    }
    k++;
  }
  fil(dp1, k);
}
void kmp2() {
  fil(dp2, 0);
  if (n <= 2) return;
  int k = 0, i;
  if (A[1] == B[0]) k++;
  fil(dp2, k);
  for (i = 2; i < n - 1; i++) {
    while (1) {
      if (A[i] == B[k]) break;
      if (k == 0) {
        k--;
        break;
      }
      k = pre[k - 1];
    }
    k++;
    fil(dp2, k);
  }
}
int main() {
  int T, t = 1, m, i, j, k;
  scanf("%s", A);
  strcpy(B, A);
  n = strlen(A);
  prefixFunc(B, n);
  kmp1();
  kmp2();
  for (i = n; i > -1; i--)
    if (dp1[i] && dp2[i]) break;
  if (i) {
    A[i] = 0;
    puts(A);
  } else
    puts("Just a legend");
  return 0;
}