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 inf1 = 0x3f3f3f3f;
const int inf2 = 0x7fffffff;
const long long INF = ((long long)1) << 61;
template <typename T>
using min_q = priority_queue<T, vector<T>, greater<T>>;
inline int read() {
  char c = getchar();
  int x = 0;
  bool sgn = false;
  while (c < '0' || c > '9') {
    if (c == '-') {
      sgn = true;
    }
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = (x << 1) + (x << 3) + (c & 15);
    c = getchar();
  }
  return sgn ? -x : x;
}
const int maxn = 1e6 + 5;
int nex[maxn];
string s;
int l;
void getnex() {
  int i = 0, j = -1;
  nex[0] = -1;
  while (i < l) {
    if (j == -1 || s[i] == s[j])
      nex[++i] = ++j;
    else
      j = nex[j];
  }
}
bool kmp(int len) {
  int j = 0;
  for (int i = 1; i <= l - 2; i++) {
    while (j && s[j] != s[i]) j = nex[j];
    if (s[i] == s[j]) ++j;
    if (j == len) return true;
  }
  return false;
}
int main() {
  ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
  cin >> s;
  l = ((int)(s).size());
  getnex();
  for (int k = nex[l]; k; k = nex[k]) {
    if (kmp(k)) {
      for (int i = 0; i <= k - 1; i++) printf("%c", s[i]);
      return 0;
    }
  }
  printf("Just a legend");
  return 0;
}