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;
bool Check(int N, int pos) { return (bool)(N & (1 << pos)); }
int Set(int N, int pos) { return (N | (1 << pos)); }
long long BigMod(long long B, long long P, long long M) {
  long long R = 1;
  while (P > 0) {
    if (P % 2 == 1) {
      R = (R * B) % M;
    }
    P /= 2;
    B = (B * B) % M;
  }
  return R;
}
const int N = 1e6;
int kmp[N + 5];
string str;
void genKMP() {
  int m = str.length(), k;
  kmp[0] = -1;
  for (int i = 1; i <= m; i++) {
    k = kmp[i - 1];
    while (k >= 0) {
      if (str[k] == str[i - 1])
        break;
      else
        k = kmp[k];
    }
    kmp[i] = k + 1;
  }
}
int main() {
  cin >> str;
  genKMP();
  int len = str.size();
  int found = 0;
  string s;
  if (kmp[len] != 0) {
    for (int i = 1; i <= len - 1; i++) {
      if (kmp[i] == kmp[len]) {
        found = 1;
        break;
      }
    }
    if (!found) {
      str = str.substr(len - kmp[len], kmp[len]);
      len = str.size();
      genKMP();
      if (kmp[len] != 0) found = 1;
    }
  }
  if (found) {
    for (int i = 0; i < kmp[len]; i++) cout << str[i];
  } else {
    cout << "Just a legend";
  }
}