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;
inline int gc() {
  static const int BUF = 1e7;
  static char buf[BUF], *bg = buf + BUF, *ed = bg;
  if (bg == ed) fread(bg = buf, 1, BUF, stdin);
  return *bg++;
}
inline int ri() {
  int x = 0, f = 1, c = gc();
  for (; c < 48 || c > 57; f = c == '-' ? -1 : f, c = gc())
    ;
  for (; c > 47 && c < 58; x = x * 10 + c - 48, c = gc())
    ;
  return x * f;
}
const int maxN = 1e5 + 7;
string s;
void KMP_next(string &T, vector<int> &nxt) {
  nxt.resize(T.size() + 1);
  nxt[0] = -1;
  int t = -1, i = 0;
  while (i < T.size()) {
    (0 > t || T[i] == T[t]) ? nxt[++i] = ++t : t = nxt[t];
  }
}
int main() {
  while (cin >> s) {
    string ans = "";
    vector<int> nxt;
    KMP_next(s, nxt);
    unordered_set<int> si;
    for (int i = 0; i < (nxt.size() - 1); ++i) si.insert(nxt[i]);
    int p = nxt[nxt.size() - 1];
    while (p > 0) {
      if (si.find(p) != si.end()) {
        ans = s.substr(0, p);
        break;
      }
      p = nxt[p];
    }
    if (ans == "")
      cout << "Just a legend\n";
    else
      cout << ans << endl;
  }
  return 0;
}