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;
int n, prefix[1000001], avail[1000001] = {0};
string s;
void print() {
  for (int j = 0; j < n; j++) cout << prefix[j] << " ";
  cout << endl;
  return;
}
void build_prefix_array() {
  int i = 1, j = 0;
  prefix[0] = 0;
  while (i < n) {
    if (s[j] == s[i]) {
      prefix[i] = j + 1;
      j++;
      i++;
    } else {
      while (j != 0) {
        j = prefix[j - 1];
        if (s[j] == s[i]) {
          prefix[i] = j + 1;
          j++;
          break;
        }
      }
      if (j == 0 && s[j] != s[i]) prefix[i] = 0;
      i++;
    }
  }
  for (int k = 1; k < n - 1; k++) {
    if (!prefix[k]) continue;
    int start = k - prefix[k] + 1;
    avail[prefix[k]]++;
  }
  return;
}
int solve() {
  int ans = prefix[n - 1];
  while (ans != 0) {
    if (avail[ans]) return ans;
    int last = ans - 1;
    ans = prefix[last];
  }
  return 0;
}
int main() {
  cin >> s;
  n = s.length();
  build_prefix_array();
  int ans = solve();
  if (ans == 0)
    cout << "Just a legend\n";
  else {
    for (int j = 0; j < ans; j++) cout << s[j];
    cout << endl;
  }
  return 0;
}