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;
string s;
int z[1111111];
void pre() {
  int l = 0, r = 0;
  for (int i = 1; i < s.size(); i++) {
    if (i >= r) {
      while (i + z[i] < s.size()) {
        if (s[z[i]] == s[z[i] + i])
          z[i]++;
        else
          break;
      }
      if (l + z[i] - 1 > r) {
        l = i, r = i + z[i] - 1;
      }
    } else {
      int can = z[i - l];
      if (i + can - 1 <= r) {
        z[i] = can;
      } else {
        int cur;
        for (cur = r; cur <= i + can && cur < s.size(); cur++) {
          if (s[cur - l] != s[cur]) {
            break;
          }
        }
        z[i] = cur - i;
        if (l + z[i] - 1 > r) {
          l = i, r = i + z[i] - 1;
        }
      }
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ;
  cin >> s;
  pre();
  int mx = 0;
  for (int i = 0; i < s.size(); i++) {
    if (z[i] > z[mx]) mx = i;
  }
  int ans = 0;
  for (int i = 0; i < s.size(); i++) {
    if (i == mx) continue;
    if (z[i] == 0) continue;
    if (z[s.size() - z[i]] == z[i]) {
      ans = max(ans, z[i]);
    }
  }
  if (ans)
    cout << s.substr(0, ans) << endl;
  else
    cout << "Just a legend" << endl;
  ;
  return 0;
}