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;
#pragma comment(linker, "/STACK:64000000")
const int N = 1e6 + 10;
int n;
char second[N];
int z[N];
void zFunction() {
  z[0] = 0;
  for (int i = 1, l = 0, r = 0; i < n; i++) {
    if (i <= r) {
      z[i] = min(r - i + 1, z[i - l]);
    }
    while (i + z[i] < n && second[z[i]] == second[i + z[i]]) {
      z[i]++;
    }
    if (i + z[i] - 1 > r) {
      l = i;
      r = i + z[i] - 1;
    }
  }
}
bool check(int len) { return z[n - len] == len; }
bool ok(int len) {
  for (int i = 1; i + len - 1 < n - 1; i++) {
    if (z[i] >= len) {
      return true;
    }
  }
  return false;
}
bool imp() {
  cout << "Just a legend\n";
  exit(0);
}
void print(int len) {
  for (int i = 0; i < len; i++) {
    putchar(second[i]);
  }
  putchar('\n');
  exit(0);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> second;
  n = (int)strlen(second);
  zFunction();
  vector<int> lens;
  for (int len = 1; len <= n; len++) {
    if (check(len)) {
      lens.push_back(len);
    }
  }
  if ((int)(lens).size() == 0) {
    imp();
  }
  int lf = 0, rg = (int)(lens).size() - 1;
  while (rg - lf > 1) {
    int mid = (lf + rg) >> 1;
    if (ok(lens[mid])) {
      lf = mid;
    } else {
      rg = mid - 1;
    }
  }
  if (ok(lens[rg])) {
    print(lens[rg]);
  }
  if (ok(lens[lf])) {
    print(lens[lf]);
  }
  imp();
  return 0;
}