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 maxn = 1e6 + 10;
namespace StrAlgo {
vector<int> Kmp(string s) {
  int n = (int(s.size()));
  vector<int> ans(n + 1);
  for (int i = 2; i <= n; i++) {
    ans[i] = ans[i - 1];
    while (ans[i] > 0 && s[ans[i]] != s[i - 1]) ans[i] = ans[ans[i]];
    ans[i] += s[ans[i]] == s[i - 1];
  }
  return ans;
}
vector<int> Z(string s) {
  int n = (int(s.size()));
  vector<int> ans(n + 1);
  int L = -1, R = -1;
  for (int i = 2; i <= n; i++) {
    if (i < R)
      ans[i] = min(ans[i - L + 1], R - i);
    else
      L = i, R = i;
    while (i + ans[i] <= n && s[i - 1 + ans[i]] == s[ans[i]]) ans[i]++;
    if (i + ans[i] > R) L = i, R = i + ans[i];
  }
  return ans;
}
};  // namespace StrAlgo
void print(string s, int len) {
  if (len == 0)
    cout << "Just a legend\n";
  else
    cout << s.substr((int(s.size())) - len) << "\n";
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(), cout.tie();
  string s;
  cin >> s;
  int n = (int(s.size()));
  vector<int> z = StrAlgo::Z(s);
  int ln = 0;
  for (int i = 2; i <= n; i++) {
    ln = max(ln, z[i] - (i + z[i] == n + 1));
  }
  for (int i = 2; i <= n; i++) {
    if (i + z[i] == n + 1 && z[i] <= ln)
      return cout << s.substr(i - 1) << endl, 0;
  }
  return cout << "Just a legend\n", 0;
}