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 Max = 1e6 + 10;
const int def = 0x3f3f3f3f;
string a, b, c;
int nex[Max];
void getnex(int len) {
  int k = -1, j = 0;
  nex[j] = k;
  while (j <= len) {
    if (k == -1 || a[k] == a[j]) {
      nex[++j] = ++k;
    } else {
      k = nex[k];
    }
  }
}
int kmp(int lenb, int lenc) {
  int i = 0, j = 0;
  while (i < lenb && j < lenc) {
    if (j == -1 || b[i] == c[j]) {
      i++;
      j++;
    } else
      j = nex[j];
  }
  if (j == lenc) return 1;
  return 0;
}
int main() {
  int i, j, h;
  int n, m;
  cin >> a;
  int len = a.length();
  for (i = 1; i < len - 1; i++) b += a[i];
  getnex(a.length());
  int k = len;
  if (len <= 2) {
    printf("Just a legend");
    return 0;
  }
  int flag = 0;
  while (nex[k]) {
    c.clear();
    for (i = 0; i < nex[k]; i++) c += a[i];
    if (kmp(len - 2, nex[k])) {
      flag = 1;
      break;
    }
    k = nex[k];
  }
  if (flag)
    cout << c;
  else
    printf("Just a legend");
}