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;
unsigned long long fpow(int val, int p) {
  if (p == 0) return 1;
  if (p == 1) return val;
  if (p % 2 == 0) {
    unsigned long long half = fpow(val, p / 2);
    return half * half;
  } else {
    unsigned long long half = fpow(val, p / 2);
    return val * half * half;
  }
}
char s[1001000];
unsigned long long hpmemo[1001000];
vector<int> eq;
int n;
int check(int mid) {
  unsigned long long hp, hs;
  int l = eq[mid];
  unsigned long long inv = fpow(61, l - 1);
  int flag = 0;
  hs = 0;
  hp = hpmemo[l - 1];
  for (int i = 1; i <= l; i++) hs = hs * 61 + s[i] - 'a';
  if (hs == hp) {
    flag = 1;
  }
  for (int i = 2; i + l - 1 < n - 1; i++) {
    hs = (hs - (s[i - 1] - 'a') * inv) * 61 + s[i + l - 1] - 'a';
    if (hs == hp) {
      flag = 1;
    }
  }
  return flag;
}
int main(void) {
  scanf("%s", s);
  n = strlen(s);
  unsigned long long hp = 0, hs = 0;
  for (int i = 1; i <= n - 2; i++) {
    hp = hp * 61 + s[i - 1] - 'a';
    hs = hs + (s[n - i] - 'a') * fpow(61, i - 1);
    if (hp == hs) {
      eq.push_back(i);
    }
    hpmemo[i - 1] = hp;
  }
  int lo = 0, hi = eq.size() - 1;
  if (hi == -1) {
    printf("Just a legend\n");
    return 0;
  }
  while (lo < hi) {
    int mid = (lo + hi) / 2;
    if (check(mid) == 0) {
      hi = mid;
    } else {
      lo = mid + 1;
    }
  }
  int found = check(lo);
  if (found == 0 && lo == 0) {
    printf("Just a legend\n");
  } else if (found == 0) {
    for (int i = 0; i < eq[lo - 1]; i++) printf("%c", s[i]);
    printf("\n");
  } else if (found == 1) {
    for (int i = 0; i < eq[eq.size() - 1]; i++) printf("%c", s[i]);
    printf("\n");
  }
  return 0;
}