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;
void swap(int *a, int *b) {
  int temp = *a;
  *a = *b;
  *b = temp;
}
long long int power(long long int a, long long int b) {
  long long int x = 1;
  long long int y = a;
  while (b > 0) {
    if (b & 1) {
      x = x * y;
      x %= 100000000;
    }
    y = y * y;
    y %= 100000000;
    b /= 2;
  }
  return x;
}
long long int inver(long long int a) { return power(a, 100000000 - 2); }
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
int gcd(int a, int b) {
  while (b != 0) {
    int temp = a;
    a = b;
    b = temp % a;
  }
  return a;
}
char a[1000010];
int main() {
  scanf("%s", a);
  int n = strlen(a);
  int pre[n];
  int i, k;
  pre[0] = k = -1;
  for (i = 1; i < n; i++) {
    while (k >= 0 && a[k + 1] != a[i]) k = pre[k];
    pre[i] = k;
    if (a[i] == a[k + 1]) pre[i] = ++k;
  }
  set<int> s;
  for (int i = 0; i < n - 1; i++) {
    s.insert(pre[i]);
  }
  int res = pre[n - 1];
  while (res >= 0) {
    if (s.find(res) != s.end()) break;
    res = pre[res];
  }
  if (res < 0) {
    cout << "Just a legend" << endl;
  } else {
    a[res + 1] = '\0';
    cout << a << endl;
  }
  return 0;
}