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 int mxN = 1e6 + 3;
int nxt[mxN], vis[mxN];
void get(string s) {
  nxt[0] = -1;
  int i = 0, k = -1, len = s.size();
  while (i < len) {
    if (k == -1 or s[i] == s[k])
      nxt[++i] = ++k;
    else
      k = nxt[k];
  }
}
int main() {
  int t;
  int n, m, i, j, c, a, b, k, cn = 0, sm = 0, mx = INT_MIN, mn = INT_MAX;
  string s, ss, sr;
  bool f = false, ff = true;
  cin >> s;
  get(s);
  nxt[0] = 0;
  n = nxt[s.size()];
  for (i = 0; i < s.size(); i++) vis[nxt[i]] = 1;
  while (n) {
    if (vis[n]) break;
    n = nxt[n];
  }
  if (!n)
    return cout << "Just a legend"
                << "\n",
           0;
  for (i = 0; i < n; i++) cout << s[i];
  return 0;
}