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 long long linf = 1e18 + 5;
const int mod = (int)1e9 + 7;
const int inf = 1e9;
long long read() {
  bool minus = false;
  long long result = 0;
  char ch;
  ch = getchar();
  while (true) {
    if (ch == '-') break;
    if (ch >= '0' && ch <= '9') break;
    ch = getchar();
  }
  if (ch == '-')
    minus = true;
  else
    result = ch - '0';
  while (true) {
    ch = getchar();
    if (ch < '0' || ch > '9') break;
    result = result * 10 + (ch - '0');
  }
  if (minus) {
    return -result;
  } else {
    return result;
  }
}
long long fpow(long long base, long long power) {
  long long result = 1;
  while (power > 0) {
    if (power % 2 == 1) result = (result * base);
    base = (base * base);
    power /= 2;
  }
  return result;
}
long long lps[1000100];
vector<long long> v[1000100];
inline void Prefix(string str) {
  long long i, j, n = str.size();
  i = 0, j = 1;
  lps[0] = 0;
  while (i < n && j < n) {
    if (str[i] == str[j]) {
      lps[j] = i + 1;
      j++;
      i++;
    } else {
      if (i > 0) {
        i = lps[i - 1];
      } else {
        lps[j] = 0;
        j++;
      }
    }
    if (j == n) break;
  }
}
inline void Sukeesh(long long n) {
  for (long long i = 0; i < n; i++) {
    v[lps[i]].push_back(i);
  }
}
bool check(long long n, long long no) {
  for (long long i = 0; i < v[n].size(); i++) {
    if (v[n][i] != no) return 1;
  }
  return 0;
}
int main() {
  string str;
  cin >> str;
  Prefix(str);
  Sukeesh(str.size());
  long long n = str.size() - 1;
  while (n > 0) {
    if (lps[n] > 0) {
      if (check(lps[n], str.size() - 1)) {
        for (long long i = 0; i < lps[n]; i++) {
          cout << str[i];
        }
        return 0;
      }
    } else {
      return 0 * printf("Just a legend");
    }
    n = lps[n] - 1;
  }
  return 0 * printf("Just a legend");
}