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;
vector<int> buildFF(string &line) {
  int m = line.size();
  vector<int> F(m + 1);
  for (int i = 2; i <= m; i++)
    for (int j = F[i - 1];;) {
      if (line[j] == line[i - 1]) {
        F[i] = j + 1;
        break;
      }
      if (j == 0) {
        F[i] = 0;
        break;
      }
      j = F[j];
    }
  return F;
}
bool KMP(string &text, string &pattern) {
  vector<int> F = buildFF(pattern);
  int n = text.size(), m = pattern.size();
  int c = 0;
  for (int i = 0, j = 0; i < n;) {
    if (text[i] == pattern[j]) {
      ++i, ++j;
      if (j == m) {
        c++;
        if (c == 3) return true;
      }
    } else if (j)
      j = F[j];
    else
      ++i;
  }
  return false;
}
int main() {
  string s;
  cin >> s;
  vector<int> ord = buildFF(s);
  int j = ord.back();
  while (j) {
    string pattern = s.substr(0, j);
    if (KMP(s, pattern)) {
      cout << pattern;
      return 0;
    }
    j = ord[j];
  }
  cout << "Just a legend";
}