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 zAlgo(string str, int z[]) {
  int l = 0, r = 0;
  z[0] = str.size();
  for (int i = 1; i < str.size(); i++) {
    if (i > r) {
      int n = 0;
      while (n + i < str.size() && str[n] == str[n + i]) {
        n++;
      }
      z[i] = n;
      if (n) {
        l = i;
        r = i + n - 1;
      }
    } else {
      int p = i - l;
      if (z[p] < r - i + 1) {
        z[i] = z[p];
      } else {
        int k = r + 1;
        while (k < str.size() && str[k] == str[k - i]) {
          k++;
        }
        z[i] = k - i;
        l = i;
        r = k - 1;
      }
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  string str;
  cin >> str;
  int z[str.size()];
  zAlgo(str, z);
  int maxz = -1;
  int i = 1;
  for (; i < str.size(); i++) {
    if (z[i] == str.size() - i && maxz >= z[i]) {
      cout << str.substr(0, z[i]) << '\n';
      break;
    }
    maxz = max(maxz, z[i]);
  }
  if (i == str.size()) {
    cout << "Just a legend\n";
  }
  return 0;
}