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;
int n, m;
inline int Read() {
  int y = 0, f = 1;
  char c = getchar();
  while (!isdigit(c)) {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (isdigit(c)) {
    y = y * 10 + (c - '0'), c = getchar();
  }
  return y * f;
}
inline void read(int &x) { x = Read(); }
char a[1000005], b[1000005];
int nxt[1000005];
void work() {
  cin >> a + 1;
  int n = strlen(a + 1);
  int j = 0;
  nxt[1] = 0;
  for (int i = 1; i <= n; i++) {
    if (i == 1) continue;
    while (j > 0 && (a[j + 1] != a[i])) {
      j = nxt[j];
    }
    if (a[i] == a[j + 1]) ++j;
    nxt[i] = j;
  }
  int Max = 0;
  for (int i = 1; i <= n - 1; i++) Max = max(Max, nxt[i]);
  int Ans = nxt[n];
  if (!Ans || !Max) {
    cout << "Just a legend";
  } else {
    int j = nxt[n];
    while (j > Max) j = nxt[j];
    if (!j) {
      cout << "Just a legend";
      return;
    }
    for (int i = 1; i <= j; i++) cout << a[i];
  }
}
int main() {
  int T = 1;
  while (T--) {
    work();
  }
  return 0;
}