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 OO = 1e9;
const long long INF = 1e18;
const int irand(int lo, int hi) {
  return ((double)rand() / (RAND_MAX + 1.0)) * (hi - lo + 1) + lo;
}
const long long lrand(long long lo, long long hi) {
  return ((double)rand() / (RAND_MAX + 1.0)) * (hi - lo + 1) + lo;
}
template <typename T>
T getnum() {
  int sign = 1;
  T ret = 0;
  char c;
  do {
    c = getchar();
  } while (c == ' ' || c == '\n');
  if (c == '-')
    sign = -1;
  else
    ret = c - '0';
  while (1) {
    c = getchar();
    if (c < '0' || c > '9') break;
    ret = 10 * ret + c - '0';
  }
  return sign * ret;
}
inline void ini(int& x) { x = getnum<int>(); }
inline void scani(int& x) { scanf("%d", &x); }
const int N = 1e6 + 5;
string str;
string str2;
int kmp[N];
int kmp2[N];
bool cek(string pat) {
  kmp2[0] = -1;
  for (int i = 0, j = -1; i < pat.size(); i++, j++) {
    while ((j >= 0) && (pat[i] != pat[j])) j = kmp2[j];
    kmp2[i + 1] = j + 1;
  }
  int found = -1;
  for (int i = 0, j = 0; i < str2.size(); i++, j++) {
    while ((j >= 0) && (str2[i] != pat[j])) j = kmp2[j];
    if (j + 1 == pat.size()) {
      found = i - j;
      break;
    }
  }
  return found != -1;
}
int main() {
  cin >> str;
  if (str.size() < 3) {
    cout << "Just a legend" << '\n';
    return 0;
  }
  str2 = str.substr(1, str.size() - 2);
  kmp[0] = -1;
  for (int i = 0, j = -1; i < str.size(); i++, j++) {
    while ((j >= 0) && (str[i] != str[j])) j = kmp[j];
    kmp[i + 1] = j + 1;
  }
  int ans = -1;
  int now = kmp[str.size()];
  while (now > 0) {
    if (cek(str.substr(0, now))) {
      ans = now;
      break;
    }
    now = kmp[now];
  }
  if (ans == -1)
    cout << "Just a legend" << '\n';
  else
    cout << str.substr(0, ans) << '\n';
  return 0;
}