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;
string s;
const int N = 10e6;
int first[N + 1];
void fail(string &s) {
  int i = 0, j = 0;
  first[0] = 0;
  int n = s.size();
  for (int i = 1; i < n; i++) {
    if (s[i] == s[j]) {
      first[i] = j + 1;
      j++;
    } else {
      while (j != 0) {
        j = first[j - 1];
        if (s[j] == s[i]) {
          first[i] = j + 1;
          j++;
          break;
        }
      }
      if (j == 0) first[i] = 0;
    }
  }
}
int main() {
  std::ios::sync_with_stdio(false);
  cin >> s;
  fail(s);
  int n = s.size();
  if (first[n - 1] == 0) {
    cout << "Just a legend";
    return 0;
  }
  if (2 * first[n - 1] > n) {
    int x = 2 * first[n - 1] - n;
    int y = first[n - 1] - x;
    for (int i = y; x--; i++) cout << s[i];
  } else {
    int i;
    for (i = 1; i < n - 1; i++)
      if (first[i] == first[n - 1]) break;
    if (i == n - 1) {
      int x = first[first[n - 1] - 1];
      if (x == 0)
        cout << "Just a legend";
      else
        for (int i = 0; i < x; i++) cout << s[i];
    } else {
      for (int i = 0; i < first[n - 1]; i++) cout << s[i];
    }
  }
  return 0;
}