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 d4i[4] = {-1, 0, 1, 0}, d4j[4] = {0, 1, 0, -1};
const int d8i[8] = {-1, -1, 0, 1, 1, 1, 0, -1},
          d8j[8] = {0, 1, 1, 1, 0, -1, -1, -1};
void DBG() { cout << "]" << endl; }
string to_string(string strin) { return strin; }
string to_string(vector<int>& vec) {
  string t = "";
  for (int i = (0), _c = (vec.size() - 1); i <= _c; ++i)
    t += to_string(vec[i]) + (i ^ (vec.size() - 1) ? " " : "");
  return t;
}
template <class H, class... T>
void DBG(H h, T... t) {
  cout << to_string(h);
  if (sizeof...(t)) cout << ", ";
  DBG(t...);
}
template <class T>
bool umin(T& a, const T& b) {
  return b < a ? a = b, 1 : 0;
}
template <class T>
bool umax(T& a, const T& b) {
  return a < b ? a = b, 1 : 0;
}
vector<int> makeZ(const string& s) {
  int n = ((int)((s).size()));
  vector<int> z(n, 0);
  z[0] = n;
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(z[i - l], r - i + 1);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
  return z;
}
void test_case() {
  string s;
  cin >> s;
  vector<int> z = makeZ(s);
  int n = ((int)((s).size()));
  int ans = 0, ma = 0;
  for (int i = (1), _c = (n - 1); i <= _c; ++i) {
    if (z[i] == n - i && ma >= z[i]) {
      ans = z[i];
      break;
    }
    umax(ma, z[i]);
  }
  if (ans == 0)
    cout << "Just a legend"
         << "\n";
  else
    cout << s.substr(0, ans) << "\n";
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  auto time = clock();
  int test = 1;
  while (test--) {
    test_case();
  }
  cerr << "[It took " << fixed << setprecision(3)
       << double(clock() - time) / CLOCKS_PER_SEC << "s]"
       << "\n";
  return 0;
}