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;
long long exp(long long a, long long p) {
  long long result = 1;
  if (p == 0) return 1;
  if (p == 1) return a;
  while (p) {
    if (p & 1) result *= a;
    p >>= 1;
    a *= a;
  }
  return result;
}
struct RH {
  vector<long long> rh;
  RH(string &s) {
    int N = s.length();
    rh.resize(N + 1, 0);
    rh[N] = 0;
    rh[N - 1] = s[N - 1];
    for (int i = N - 2; i >= 0; i--) {
      rh[i] = s[i] + rh[i + 1] * 33;
    }
  }
  long long getHash(int i, int len) {
    return rh[i] - rh[i + len] * exp(33, len);
  }
};
int main() {
  string s;
  cin >> s;
  RH rh = RH(s);
  int len = s.length();
  int l = len;
  bool flag = false;
  long long h;
  while (!flag) {
    h = rh.getHash(0, l);
    if (h == rh.getHash(len - l, l)) {
      for (int i = 1; i < len - l; i++) {
        if (h == rh.getHash(i, l)) {
          flag = true;
          break;
        }
      }
      if (!flag) l--;
    } else {
      l--;
    }
    if (l == 0) {
      cout << "Just a legend" << endl;
      return 0;
    }
  }
  cout << s.substr(0, l) << endl;
  return 0;
}