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 = 31;
const int m = 1e9 + 9;
long long p_pow[1000009];
void preprocess() {
  p_pow[0] = 1;
  for (int i = 1; i < 1000009; i++) p_pow[i] = (p_pow[i - 1] * p) % m;
}
long long get_hash(string const& s) {
  long long hash = 0;
  for (int i = 0; i < s.size(); i++)
    hash = (hash + (s[i] - 'a' + 1) * p_pow[i]) % m;
  return hash;
}
vector<long long> get_prefix_hash(string const& s) {
  int siz = s.size();
  vector<long long> h(siz + 1, 0);
  for (int i = 0; i < siz; i++)
    h[i + 1] = (h[i] + (s[i] - 'a' + 1) * p_pow[i]) % m;
  return h;
}
long long get_sub(int start, int len, const vector<long long>& h) {
  return (h[start + len] - h[start] + m) % m;
}
bool compare(int start1, int start2, int len, const vector<long long>& h) {
  if (start1 > start2) swap(start1, start2);
  return get_sub(start1, len, h) * p_pow[start2 - start1] % m ==
         get_sub(start2, len, h);
}
void solve() {
  preprocess();
  string s;
  cin >> s;
  int n = s.size();
  vector<int> sizs;
  vector<long long> pres = get_prefix_hash(s);
  for (int i = 1; i <= n - 2; i++) {
    if (compare(0, n - i, i, pres)) sizs.push_back(i);
  }
  int l = 0;
  int r = sizs.size();
  while (l < r) {
    int mm = (l + r) / 2;
    int len = sizs[mm];
    int ok = 0;
    for (int i = 1; i + len - 1 < n - 1; i++)
      if (compare(i, 0, len, pres)) ok = 1;
    if (ok)
      l = mm + 1;
    else
      r = mm;
  }
  l--;
  if (l >= 0)
    cout << s.substr(0, sizs[l]) << endl;
  else
    cout << "Just a legend" << endl;
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  solve();
  return 0;
}