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;
map<int, int> mapp;
string s;
int Z[1000001];
void Zval() {
  int left = 0, right = 0;
  for (int k = 1; k < s.size(); k++) {
    if (k > right) {
      left = right = k;
      while (right < s.size() && s[right] == s[right - left]) right++;
      Z[k] = right - left;
      right--;
    } else {
      int k1 = k - left;
      if (Z[k1] < right - k + 1)
        Z[k] = Z[k1];
      else {
        left = k;
        while (right < s.size() && s[right] == s[right - left]) right++;
        Z[k] = right - left;
        right--;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int t;
  int n, m;
  int i, j;
  cin >> s;
  n = s.size();
  Zval();
  int maxz = -1, ans = -1;
  for (i = 0; i < n; i++) {
    if (Z[i] == n - i && maxz >= n - i) {
      ans = i;
      break;
    }
    maxz = max(maxz, Z[i]);
  }
  if (ans == -1)
    cout << "Just a legend";
  else
    cout << s.substr(ans, n);
  return 0;
}