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;
void solve() {
  string s;
  cin >> s;
  int n = s.length();
  int f[n], len = 0, i = 1, c = 0, j = 0;
  f[0] = 0;
  while (i < n) {
    if (s[len] == s[i])
      f[i++] = ++len;
    else {
      if (len != 0)
        len = f[len - 1];
      else
        f[i++] = 0;
    }
    if (i >= n) break;
  }
  string pattern = s.substr(0, f[n - 1]);
  int m = f[n - 1];
  i = 0, j = 0;
  int l = 0, r = m, mid;
  while (l < r) {
    mid = l + (r - l + 1) / 2;
    pattern = s.substr(0, mid);
    c = 0, i = 0, j = 0;
    while (i < n) {
      if (pattern[j] == s[i])
        i++, j++;
      else {
        if (j != 0)
          j = f[j - 1];
        else
          i++;
      }
      if (j == mid) {
        c++, j = f[j - 1];
      }
      if (i >= n) break;
    }
    if (c >= 3)
      l = mid;
    else
      r = mid - 1;
  }
  pattern = s.substr(0, l);
  reverse(s.begin(), s.end());
  string p2 = s.substr(0, l);
  reverse(p2.begin(), p2.end());
  if (l > 0 && pattern == p2)
    cout << pattern << endl;
  else
    cout << "Just a legend" << endl;
}
int main() {
  ios::sync_with_stdio(false);
  int t = 1;
  while (t--) {
    solve();
  }
  return 0;
}