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;
vector<long long> vec[(long long)(1e6)];
vector<long long> comp;
long long vis[(long long)(1e6)];
long long dis[(long long)(1e6)];
void DFS(long long x) {
  vis[x] = true;
  for (long long i = 0; i < vec[x].size(); i++) {
    if (!vis[vec[x][i]]) {
      DFS(vec[x][i]);
    }
  }
}
long long power(long long x, long long y) {
  long long temp;
  if (y == 0) return 1;
  temp = power(x, y / 2);
  if (y % 2 == 0)
    return (temp * temp) % ((long long)(1e9 + 7));
  else
    return (x * temp * temp) % (long long)(1e9 + 7);
}
const long long N = 100000;
long long pr[1005];
void coding() {
  long long i, j, k, l, n, m, t;
  string s;
  cin >> s;
  n = s.length();
  vector<long long> pref(n);
  map<long long, bool> mp;
  for (long long i = 1; i < n; i++) {
    j = pref[i - 1];
    while (j > 0 && s[j] != s[i]) j = pref[j - 1];
    if (s[i] == s[j]) j++;
    pref[i] = j;
    if (i != n - 1) mp[pref[i]] = true;
  }
  j = pref[n - 1];
  while (j > 0) {
    if (mp[j]) {
      for (long long i = 0; i < j; i++) cout << s[i];
      return;
    }
    j = pref[j - 1];
  }
  cout << "Just a legend";
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  cout << fixed << setprecision(11);
  while (t--) {
    coding();
  }
}