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;
template <class A, class B>
A cvt(B x) {
  stringstream ss;
  ss << x;
  A y;
  ss >> y;
  return y;
}
string s;
int n;
int cnt(int len, long long h) {
  long long a = 0, p = 1;
  for (int i = 0; i < (int)(len - 1); i++) p = (p * 31) % 1000000007;
  int c = 0;
  for (int i = 0; i < (int)(n); i++) {
    if (i >= len) {
      a = (a - p * (s[i - len] - 'a')) % 1000000007;
      if (a < 0) a += 1000000007;
    }
    a = (a * 31 + (s[i] - 'a')) % 1000000007;
    if (i >= len - 1 && a == h) c++;
  }
  return c;
}
int main() {
  cin >> s;
  n = s.size();
  long long a = 0, b = 0, p = 1;
  vector<pair<int, int> > sizes;
  for (int i = (1); i <= (n - 1); i++) {
    a = (a * 31 + (s[i - 1] - 'a')) % 1000000007;
    b = (b + p * (s[n - i] - 'a')) % 1000000007;
    p = (p * 31) % 1000000007;
    if (a == b) sizes.push_back({i, a});
  }
  int lo = -1, hi = sizes.size();
  while (lo + 1 < hi) {
    int mid = (lo + hi) / 2;
    auto [sz, h] = sizes[mid];
    if (cnt(sz, h) >= 3)
      lo = mid;
    else
      hi = mid;
  }
  if (lo == -1)
    cout << "Just a legend" << endl;
  else
    cout << s.substr(0, sizes[lo].first) << endl;
  return 0;
}