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;
vector<int> findz(string s) {
  int n = s.length();
  vector<int> zarr(n, 0);
  int l, r, k;
  l = r = 0;
  for (int i = 1; i < n; i++) {
    if (i > r) {
      l = r = i;
      while (r < n && s[r - l] == s[r]) r++;
      zarr[i] = r - l;
      r--;
    } else {
      k = i - l;
      if (i + zarr[k] - 1 < r) {
        zarr[i] = zarr[k];
      } else {
        l = i;
        while (r < n && s[r - l] == s[r]) r++;
        zarr[i] = r - l;
        r--;
      }
    }
  }
  return zarr;
}
int main() {
  string s;
  cin >> s;
  int n = s.length();
  vector<int> zpre = findz(s);
  int max_so_far = 0;
  for (int i = 0; i < n; i++) {
    if (zpre[i] == n - i && max_so_far >= n - i) {
      int id = n - i;
      for (int j = 0; j < id; j++) printf("%c", s[j]);
      return 0;
    }
    max_so_far = max(max_so_far, zpre[i]);
  }
  cout << "Just a legend" << endl;
  return 0;
}