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 N = 1e6 + 123;
const int mod = 1e9 + 7;
const int INF = 1e9 + 1;
const long long INFL = 1e18 + 1;
const double eps = 1e-9;
const double pi = acos(-1.0);
int p[N];
int pw[N], P = 31;
int mult(int a, int b) { return (1ll * a * b) % mod; }
int add(int a, int b) {
  a += b;
  if (a >= mod) a -= mod;
  return a;
}
int subs(int a, int b) {
  a -= b;
  if (a < 0) a += mod;
  return a;
}
struct num {
  int n;
  string second;
  vector<int> h;
  void in() {
    cin >> second;
    n = second.size();
    h.resize(n);
    h[0] = second[0];
    for (int i = 1; i < second.size(); i++) {
      h[i] = add(mult(h[i - 1], P), second[i]);
    }
  }
  int get(int l, int r) {
    if (l > r) return 0;
    if (l == 0) return h[r];
    int res = 0;
    res = subs(h[r], mult(h[l - 1], pw[r - l + 1]));
    return res;
  }
} second, ch;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  second.in();
  pw[0] = 1;
  for (int i = 1; i < second.second.size(); i++) {
    pw[i] = mult(pw[i - 1], P);
  }
  int mx = 0;
  for (int len = second.n - 1; len >= 1; len--) {
    if (second.get(0, len - 1) == second.get(second.n - len, second.n - 1) &&
        len > mx) {
      for (int i = 1; i + len - 1 <= second.second.size() - 2; i++) {
        if (second.get(i, i + len - 1) == second.get(0, len - 1) && len > mx) {
          mx = len;
        }
      }
    }
  }
  if (mx)
    for (int i = 0; i < mx; i++) cout << second.second[i];
  else
    cout << "Just a legend";
  return 0;
}