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 GCC optimize(3)
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; }
using namespace std;
const int maxn = 1e6 + 11;
const unsigned long long mod = 1e9 + 7;
unsigned long long p1[maxn], p2[maxn], h1[maxn], h2[maxn], ans,
    base = 131, base2 = 31, a[maxn], top;
char str[maxn];
inline unsigned long long get(int l, int r, unsigned long long g[],
                              unsigned long long p[]) {
  return (unsigned long long)g[r] - g[l - 1] * p[r - l + 1];
}
inline void fun(const int& len) {
  unsigned long long head = 1, tail = len;
  for (int i = 1; i <= len; i++)
    if ((get(head, head + i - 1, h1, p1)) == get(tail - i + 1, tail, h1, p1) &&
        (get(head, head + i - 1, h2, p2)) == get(tail - i + 1, tail, h2, p2))
      a[++top] = i;
}
bool check(int x, int len) {
  unsigned long long tar1 = get(1, x, h1, p1), tar2 = get(1, x, h2, p2);
  for (int i = 2; i + x - 1 < len; i++)
    if (tar1 == get(i, i + x - 1, h1, p1) && tar2 == get(i, i + x - 1, h2, p2))
      return 1;
  return 0;
}
int main() {
  p2[0] = p1[0] = 1;
  for (int i = 1; i < maxn; i++)
    p1[i] = p1[i - 1] * base, p2[i] = p2[i - 1] * base2;
  scanf("%s", str);
  int len = strlen(str);
  for (int i = 1; i <= len; i++) {
    h1[i] = h1[i - 1] * base + (str[i - 1] - 'a' + 1);
    h2[i] = h2[i - 1] * base2 + (str[i - 1] - 'a' + 1);
  }
  fun(len);
  int l = 1, r = top, mid, ans = -1;
  while (l <= r) {
    mid = (l + r) >> 1;
    if (check(a[mid], len))
      l = mid + 1, ans = a[mid];
    else
      r = mid - 1;
  }
  if (ans == -1)
    puts("Just a legend");
  else {
    for (int i = 0; i < ans; i++) printf("%c", str[i]);
    puts("");
  }
}