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 maxstrlen = 1e6;
unsigned long long mod[] = {(int)1e9 + 7, (int)1e9 + 9};
class RH {
  static vector<unsigned long long> x[2];
  vector<unsigned long long> h[2];
  string str;
  int n;
  unsigned long long hash(int a, int start, int len) {
    unsigned long long ans = 0, end = start + len;
    ans += h[a][start] - h[a][end] * x[a][len] % mod[a] + mod[a];
    return ans % mod[a];
  }

 public:
  RH() {}
  RH(const string &str) {
    this->str = str;
    n = str.size();
    if (x[0].empty())
      for (int a = 0; a < (int)2; ++a) {
        x[a].assign(maxstrlen + 1, 1);
        for (int i = 0; i < (int)maxstrlen; ++i)
          x[a][i + 1] = x[a][i] * 127 % mod[a];
      }
    for (int a = 0; a < (int)2; ++a) {
      h[a].assign(n + 1, 0);
      for (int i = n - 1; i >= 0; --i)
        h[a][i] = (h[a][i + 1] * 127 + str[i]) % mod[a];
    }
  }
  unsigned long long hash(int start, int len) {
    return hash(0, start, len) << 32 | hash(1, start, len);
  }
};
vector<unsigned long long> RH::x[2];
int main() {
  string Texto;
  cin >> Texto;
  int Indice = -1;
  RH RoHa(Texto);
  for (int i = 0; i < Texto.size() - 1; ++i) {
    if (RoHa.hash(0, i + 1) == RoHa.hash(Texto.size() - 1 - i, i + 1)) {
      for (int j = 1; j + i < Texto.size() - 1; ++j) {
        if (RoHa.hash(0, i + 1) == RoHa.hash(j, i + 1)) {
          Indice = i;
          break;
        }
      }
    }
  }
  if (Indice == -1) {
    cout << "Just a legend" << endl;
  } else {
    cout << Texto.substr(0, Indice + 1);
  }
}