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;
void solve();
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t;
  for (int tt = 0, _tt = (1); tt < _tt; ++tt) {
    solve();
    cout << '\n';
  }
}
vector<int> string_z(string s) {
  int n = s.length();
  vector<int> z(n);
  int l = 0, r = 0;
  for (int i = (1), _i = (n); i < _i; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (s[i + z[i]] == s[z[i]] && (i + z[i] < n)) z[i]++;
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
  return z;
}
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  vector<int> z = string_z(s);
  map<int, int> m;
  for (int i = 0, _i = (n); i < _i; ++i) {
    if (z[i] > 0) {
      m[z[i]] = m[z[i]] + 1;
    }
  }
  int found = 0, maxlen = 0;
  for (int i = n - 1; i >= 1; i--) {
    if (((m).find(i) != (m).end())) {
      maxlen = max(maxlen, i);
      if ((z[n - i] == i) && ((m[i] > 1) || (i < maxlen))) {
        found = i;
        break;
      }
    }
  }
  cout << (found ? s.substr(0, found) : "Just a legend");
}