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;
const int maxn = 1100000;
const int magic = 3137;
unsigned long long p[maxn];
char s[maxn];
int match[maxn];
int n;
int check(int leng) {
  unsigned long long prefix = 0;
  for (int i = 0; i < leng; ++i) {
    prefix = prefix * magic + s[i];
  }
  int cnt = 1;
  unsigned long long cur = prefix;
  for (int i = leng; i < n && cnt < 3; ++i) {
    cur = cur * magic + s[i];
    cur -= p[leng] * s[i - leng];
    if (cur == prefix) {
      cnt++;
    }
  }
  return cnt >= 3;
}
int main() {
  p[0] = 1;
  for (int i = 1; i <= 1000000; ++i) {
    p[i] = p[i - 1] * magic;
  }
  scanf("%s", &s);
  n = strlen(s);
  unsigned long long prefix = 0, suffix = 0;
  for (int i = 0; i < n; ++i) {
    prefix = prefix * magic + s[i];
    suffix += p[i] * s[n - 1 - i];
    if (prefix == suffix) {
      match[i + 1] = 1;
    } else {
      match[i + 1] = 0;
    }
  }
  int lo = 1, hi = n, ans = 0;
  for (; lo <= hi;) {
    int m = (lo + hi) / 2;
    if (check(m)) {
      ans = m;
      lo = m + 1;
    } else {
      hi = m - 1;
    }
  }
  int lower = 1, upper = ans;
  for (int i = upper; i >= lower; --i) {
    if (match[i]) {
      s[i] = 0;
      printf("%s\n", s);
      return 0;
    }
  }
  printf("Just a legend\n");
}