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 P = 2017, M = 1e9 + 7;
string s;
int n;
vector<int> p, h;
int get(int l, int r) {
  if (!l) return h[r];
  return h[r] - h[l - 1] * p[r - l + 1];
}
int bs(int i) {
  int l = 0, r = n - i;
  while (l != r - 1) {
    int m = (l + r) / 2;
    if (get(i, i + m - 1) == get(0, m - 1)) {
      l = m;
    } else {
      r = m;
    }
  }
  return l;
}
int main() {
  cin >> s;
  n = s.size();
  if (s.size() < 3) {
    cout << "Just a legend";
    return 0;
  }
  if (s[0] == s[1] && s[1] == s[2] && s.size() == 3) {
    cout << s[0];
    return 0;
  } else if (s.size() == 3) {
    cout << "Just a legend";
    return 0;
  }
  p.resize(n);
  h.resize(n);
  p[0] = 1;
  for (int i = 1; i < n; i++) {
    p[i] = p[i - 1] * P;
  }
  h[0] = s[0] - 'a' + 1;
  for (int i = 1; i < n; i++) {
    h[i] = h[i - 1] * P + s[i] - 'a' + 1;
  }
  int ans = 0;
  for (int i = 1; i < n - 1; i++) {
    ans = max(ans, bs(i));
  }
  set<int> st;
  for (int i = 0; i < n; i++) {
    if (get(i, n - 1) == get(0, n - i - 1)) {
      st.insert(n - i);
    }
  }
  if (ans == 0 || st.upper_bound(ans) == st.begin()) {
    cout << "Just a legend";
    return 0;
  }
  cout << s.substr(0, *(--st.upper_bound(ans)));
}