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 = 100 * 1000 + 256;
const int xn = 1000 * 1000 + 1;
const int maxn = 1000 * 1000 * 1000 + 7;
const long long int lmaxn = 1e18 + 7;
template <class t, class u, class i>
inline t min(t x, u y, i z) {
  if (x >= y && x >= z) return x;
  if (y >= z && y >= x) return y;
  if (z >= y && z >= x) return z;
}
template <class t, class u>
inline bool ifmax(t &x, u y) {
  if (y > x) return x = y, true;
  return false;
}
template <class t, class u>
inline bool ifmin(t &x, u y) {
  if (y < x) return x = y, true;
  return false;
}
template <class t>
inline void sort(t &a) {
  sort(a.begin(), a.end());
}
template <class t>
inline void rsort(t &a) {
  sort(a.rbegin(), a.rend());
}
template <class t>
inline void reverse(t &a) {
  reverse(a.begin(), a.end());
}
template <class t>
inline t sorted(t a) {
  sort(a);
  return a;
}
int z[xn];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  string second;
  cin >> second;
  int n = second.size();
  int l = 0;
  int r = 0;
  for (int i = 1; i < n; i++) {
    if (i <= r) {
      z[i] = min(r - i + 1, z[i - l]);
    }
    while (i + z[i] < second.size() && second[z[i]] == second[i + z[i]]) {
      ++z[i];
    }
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
  int mx = 0, ans = 0;
  for (int i = 1; i < second.size(); i++) {
    if ((z[i] == second.size() - i && mx >= z[i])) {
      ans = z[i];
      break;
    }
    mx = max(mx, z[i]);
  }
  if (ans) {
    for (int i = 0; i < ans; i++) {
      cout << second[i];
    }
  } else
    cout << "Just a legend";
}