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 MN(long long int &a, long long int b) {
  if (a > b) a = b;
}
void MX(long long int &a, long long int b) {
  if (a < b) a = b;
}
void MN(int &a, long long int b) {
  if (a > b) a = b;
}
void MX(int &a, long long int b) {
  if (a < b) a = b;
}
void MN(double &a, double b) {
  if (a > b) a = b;
}
void MX(double &a, double b) {
  if (a < b) a = b;
}
long long int sqdist(long long int p1x, long long int p1y, long long int p2x,
                     long long int p2y) {
  return (p2x - p1x) * (p2x - p1x) + (p2y - p1y) * (p2y - p1y);
}
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return a * (b / gcd(a, b));
}
int z[1000001];
char str[1000001];
int main() {
  scanf("%s", str);
  int n = strlen(str);
  int l = -1, r = -1;
  for (int i = 1; i < n; i++) {
    if (i > r) {
      l = r = i;
      while (r < n && str[r] == str[r - l]) r++;
      z[i] = r - l;
      r--;
    } else {
      int k = i - l;
      if (z[k] < r - i + 1) {
        z[i] = z[k];
      } else {
        l = i;
        while (r < n && str[r] == str[r - l]) r++;
        z[i] = r - l;
        r--;
      }
    }
  }
  int onnot = -1, res = -1;
  for (int i = 0; i < n; i++) {
    if (n - i != z[i]) {
      if (z[i] > onnot) {
        onnot = z[i];
      }
    } else {
      if (onnot >= z[i]) {
        res = z[i];
        break;
      } else {
        if (z[i] > onnot) {
          onnot = z[i];
        }
      }
    }
  }
  if (res == -1)
    printf("Just a legend\n");
  else {
    for (int i = 0; i < res; i++) printf("%c", str[i]);
    printf("\n");
  }
  return 0;
}