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;
using ld = long double;
using tint = long long;
using vi = vector<int>;
using pi = pair<int, int>;
void setIO(string name = "") {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
}
const int MOD = 1e9 + 7;
const int MX = 2e5 + 5;
const int INF = 1e9;
const ld PI = acos((ld)-1);
vector<int> z(string &second) {
  int n = second.size();
  vi z(n);
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && second[z[i]] == second[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
int main() {
  setIO();
  string second;
  cin >> second;
  vi v = z(second);
  int maxi = 0, ret = 0;
  for (int i = int(0); i < int((int)(second).size()); i++) {
    if (v[i] + i == (int)(second).size() && maxi >= v[i]) {
      ret = v[i];
      break;
    }
    maxi = max(maxi, v[i]);
  }
  if (ret == 0)
    cout << "Just a legend" << endl;
  else
    cout << second.substr(0, ret) << endl;
}