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>
#pragma 03
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
vector<long long> h, p;
long long m = 1e9 + 9, po = 31;
signed main() {
  if (fopen(""
            ".INP",
            "r")) {
    freopen(
        ""
        ".INP",
        "r", stdin);
    freopen(
        ""
        ".OUT",
        "w", stdout);
  };
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  string s;
  cin >> s;
  long long n = s.length();
  h.resize(n, 0);
  p.resize(n, 1);
  long long val = 1;
  long long now = 0;
  for (long long i = 0; i < n; ++i) {
    p[i] = val;
    h[i] = (now + (s[i] - 'a' + 1) * p[i]) % m;
    now = h[i];
    val = (val * po) % m;
  }
  for (long long i = n - 2; i >= 0; --i) {
    if ((h[n - 1] + m - h[n - i - 2]) % m == (h[i] * p[n - i - 1]) % m) {
      for (long long l = 1; l < n - i - 1; ++l) {
        if ((h[i] * p[l]) % m == (h[l + i] + m - h[l - 1]) % m) {
          cout << s.substr(0, i + 1);
          return 0;
        }
      }
    }
  }
  cout << "Just a legend";
  return 0;
}