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 MX = 1000001;
const int MI = 100001;
const int MT = 10001;
char a[MX];
int z[MX], x[MX], y[MX];
int max1 = 0, max2 = 0;
int main() {
  int ans = 0;
  scanf("%s", &a);
  int w = strlen(a);
  for (int i = 1, l = 0, r = 0; i < w; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (a[z[i]] == a[z[i] + i] && z[i] + i < w) ++z[i];
    if (z[i] + i - 1 > r) r = z[i] + i - 1, l = i;
  }
  for (int i = w - 1; i > -1; --i) {
    if (z[i] == w - i) {
      if (z[i] > max1)
        max2 = max1, max1 = z[i];
      else if (z[i] > max2)
        max2 = z[i];
    }
    x[i] = max1;
    y[i] = max2;
  }
  w = w - 1;
  for (int i = 1; i < w; ++i) {
    if (z[i] == w - i + 1) {
      if (y[i] > ans) ans = y[i];
    } else {
      int s = min(x[i], min(z[i], x[w - z[i] + 1]));
      if (s > ans) ans = s;
    }
  }
  if (ans == 0) {
    puts("Just a legend");
    return 0;
  }
  for (int i = 0; i < ans; ++i) putchar(a[i]);
  return 0;
}