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;
const int maxn = 1 * 1000 * 1000 + 10;
string s;
int nxt[maxn], mx, cur, x;
bool mark[maxn];
int main() {
  cin >> s;
  if (s.length() < 3) {
    cout << "Just a legend";
    return 0;
  }
  for (int i = 2; i <= s.length(); i++) {
    while (cur && s[i - 1] != s[cur]) cur = nxt[cur];
    if (s[i - 1] == s[cur]) cur++;
    nxt[i] = cur;
    if (i == s.length()) {
      x = nxt[i];
      while (!mark[x]) x = nxt[x];
      if (x == 0) {
        cout << "Just a legend";
        return 0;
      }
      cout << s.substr(0, x);
      return 0;
    } else {
      x = nxt[i];
      while (!mark[x]) {
        mark[x] = 1;
        x = nxt[x];
      }
    }
  }
  return 0;
}