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;
char s[1000005];
unsigned long long h[10000000];
unsigned long long p[1000001];
int main() {
  unsigned long long h1, h2;
  bool flag = 0;
  stack<int> q;
  scanf("%s", s + 1);
  p[0] = 1;
  for (int i = 1; i <= 1000000; i++) p[i] = p[i - 1] * 33;
  int len = strlen(s + 1);
  for (int i = 1; i <= len; i++) h[i] = h[i - 1] * 33 + s[i];
  for (int i = 1; i < len; i++) {
    h1 = h[i];
    h2 = h[len] - h[len - i] * p[i];
    if (h1 == h2) q.push(i);
  }
  while (q.size() && !flag) {
    int t = q.top();
    for (int i = t + 1; i < len; i++) {
      if (h[t] == h[i] - h[i - t] * p[t]) {
        flag = 1;
        break;
      }
    }
    if (!flag) q.pop();
  }
  if (q.size()) {
    for (int i = 1; i <= q.top(); i++) printf("%c", s[i]);
    printf("\n");
    while (q.size()) q.pop();
  } else {
    printf("Just a legend\n");
  }
  return 0;
}