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;
int main() {
  int hash[26] = {0};
  string s;
  cin >> s;
  int n = s.length();
  if (n == 1) {
    cout << "Just a legend\n";
    return 0;
  }
  if (n >= 3) {
    for (int i = 0; i < n; i++) {
      hash[(int)s[i] - 'a']++;
    }
    int ct = 0;
    for (int i = 0; i < 26; i++) {
      if (hash[i] > 0) ct++;
    }
    if (ct == 1) {
      for (int i = 0; i < n - 2; i++) cout << s[i];
      cout << "\n";
      return 0;
    }
  }
  int z[1000006];
  int L = 0, R = 0;
  for (int i = 1; i < n; i++) {
    if (i > R) {
      L = R = i;
      while (R < n && s[R - L] == s[R]) 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 && s[R - L] == s[R]) R++;
        z[i] = R - L;
        R--;
      }
    }
  }
  set<pair<int, int> > st;
  int steps = 0;
  for (int i = n - 1; i >= 0; i--) {
    steps++;
    if (steps == z[i]) {
      st.insert(pair<int, int>(z[i], i));
    }
  }
  set<pair<int, int> >::reverse_iterator it;
  int start = -1, len = 0;
  for (it = st.rbegin(); it != st.rend(); it++) {
    if (len < it->first)
      for (int i = 0; i < it->second; i++) {
        if (z[i] >= it->first) {
          start = i;
          len = it->first;
        }
      }
  }
  if (start == -1) {
    cout << "Just a legend\n";
    return 0;
  }
  for (int i = start; i < start + len; i++) cout << s[i];
  cout << "\n";
  return 0;
}