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 N = 1e6 + 2;
long long power[2][N], h[N][2], k, mod[2];
long long match[2][N];
string input;
void precal() {
  mod[0] = 1e9 + 7;
  mod[1] = 1e9 + 9;
  power[0][0] = power[1][0] = 1;
  for (long long i = 1; i <= N - 2; i += 1) {
    power[1][i] = (power[1][i - 1] * 29) % mod[1];
    power[0][i] = (power[0][i - 1] * 29) % mod[0];
  }
}
void Hash(string in) {
  long long cnt;
  for (long long i = 0; i <= 1; i += 1) {
    cnt = 0;
    for (auto v : in) {
      cnt++;
      h[cnt][i] = (h[cnt - 1][i] * 29 + v - 'a' + 1) % mod[i];
    }
  }
}
pair<long long, long long> gethash(long long start, long long end) {
  long long res1 = (h[end][0] - h[start - 1][0] * power[0][end - start + 1] +
                    mod[0] * mod[0]) %
                   mod[0];
  long long res2 = (h[end][1] - h[start - 1][1] * power[1][end - start + 1] +
                    mod[1] * mod[1]) %
                   mod[1];
  return {res1, res2};
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  precal();
  cin >> input;
  Hash(input);
  long long output = 0;
  long long n = input.length();
  for (long long i = 2; i <= n - 1; i += 1) {
    if (input[i - 1] == input[0]) {
      long long low = i, high = n - 1, mid;
      while (low < high) {
        mid = (low + high + (low + high) % 2) / 2;
        if (gethash(i, mid) == gethash(1, mid - i + 1)) {
          low = mid;
        } else {
          high = mid - 1;
        }
      }
      if (high < n) output = max(output, high - i + 1);
    }
  }
  for (long long i = n - 2; i >= 1; i -= 1) {
    if (gethash(1, i) == gethash(n - i + 1, n) && i <= output) {
      for (long long ind = 0; ind <= i - 1; ind += 1) cout << input[ind];
      cout << "\n";
      return 0;
    }
  }
  cout << "Just a legend\n";
}