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;
long long base = 255;
const long long mod = 1e9 + 7;
string s;
int n;
vector<int> a;
long long Hash[1000001];
long long pp[1000001];
long long geth(int x, int y) {
  return (Hash[y] - Hash[x - 1] * pp[y - x + 1] + mod * mod) % mod;
}
bool check(int l, int r, long long h, int len) {
  for (int i = l; i <= r - len + 1; i++) {
    long long tmp = geth(i, i + len - 1);
    if (tmp == h) return true;
  }
  return false;
}
void binary() {
  int l = 0, r = a.size() - 1;
  int kq = -1;
  while (l <= r) {
    int mid = (l + r) / 2;
    int t = a[mid];
    if (check(2, n - 1, geth(1, a[mid]), a[mid])) {
      kq = a[mid];
      l = mid + 1;
    } else
      r = mid - 1;
  }
  if (kq == -1) {
    cout << "Just a legend";
    return;
  }
  for (int i = 1; i <= kq; i++) cout << s[i];
}
int main() {
  cin >> s;
  n = s.length();
  s = '.' + s;
  pp[0] = 1;
  for (int i = 1; i <= n; i++) {
    pp[i] = (pp[i - 1] * base) % mod;
    Hash[i] = (Hash[i - 1] * base + s[i] - '0') % mod;
  }
  for (int i = 1; i < n; i++) {
    if (geth(1, i) == geth(n - i + 1, n)) {
      a.push_back(i);
    }
  }
  binary();
  return 0;
}