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;
int kmp[1000007];
int i = 0;
void doit(string b) {
  kmp[0] = 0;
  int lth = b.length();
  for (int j = 1; j < (lth); j++) {
    while (b[j] != b[i] && i > 0) {
      i = kmp[i - 1];
    }
    if (b[j] == b[i]) {
      i++;
    } else {
      i = 0;
      if (b[j] == b[0]) {
        i++;
      }
    }
    kmp[j] = i;
  }
}
int main() {
  string a;
  cin >> a;
  doit(a);
  vector<int> check;
  int x, y;
  x = kmp[a.length() - 1];
  check.push_back(x);
  while (x > 0) {
    y = kmp[x - 1];
    check.push_back(y);
    x = y;
  }
  for (int j = 0; j < check.size(); j++) {
    x = check[j];
    if (x > 0) {
      for (int i = 1; i < (a.length() - 1); i++) {
        if (kmp[i] == x) {
          cout << a.substr(0, x);
          return 0;
          break;
        }
      }
    }
  }
  cout << "Just a legend";
  return 0;
}