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;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int dx[8] = {1, -1, 0, 0, -1, -1, 1, 1};
int dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};
vector<long long> adj[300010], par(300010, -1), vis(300010, 0);
int myrandom(int i) { return std::rand() % i; }
long long dp[102][102][12][12];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string s;
  cin >> s;
  int n = (int)s.length();
  vector<int> pre(n, 0);
  for (int i = 1; i < n; i++) {
    int j = pre[i - 1];
    while (j > 0 && s[i] != s[j]) {
      j = pre[j - 1];
    }
    if (s[i] == s[j]) j++;
    pre[i] = j;
  }
  set<int> st;
  for (int i = 1; i < n - 1; i++) {
    st.insert(pre[i]);
  }
  int v = pre[n - 1];
  while (v > 0 && st.find(v) == st.end()) {
    v = pre[v - 1];
  }
  if (v <= 0) {
    cout << "Just a legend" << '\n';
  } else {
    for (int i = 0; i < v; i++) {
      cout << s[i];
    }
    cout << '\n';
  }
}