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;
static bool cmp(pair<int, int> p1, pair<int, int> p2) {
  if (p1.first == p2.first) return p1.second < p2.second;
  return p1.first > p2.first;
}
vector<int> getZ(string s, int n) {
  vector<int> z(n);
  z[0] = 0;
  int l = 0, r = 0;
  for (int i = 1; i < n; i++) {
    if (i > r) {
      l = r = i;
      while (r < n && s[r] == s[r - l]) r++;
      z[i] = r - l;
      r--;
    } else {
      int k = i - l;
      if (i + z[k] - 1 < r)
        z[i] = z[k];
      else {
        l = i;
        while (r < n && s[r] == s[r - l]) r++;
        z[i] = r - l;
        r--;
      }
    }
  }
  return z;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(NULL);
  int n;
  string s;
  cin >> s;
  n = s.length();
  vector<int> z = getZ(s, n);
  int prefix[n];
  prefix[0] = 0;
  for (int i = 1; i < n; i++) prefix[i] = max(prefix[i - 1], z[i]);
  int ansStart = -1, ansLength = 0;
  for (int i = n - 1; i >= 1; i--) {
    int valRight = z[i];
    if (valRight > 0 && valRight == n - i) {
      if (prefix[i - 1] >= valRight) {
        if (valRight > ansLength) {
          ansStart = i;
          ansLength = valRight;
        }
      }
    }
  }
  if (ansStart == -1)
    cout << "Just a legend\n";
  else
    cout << s.substr(ansStart, ansLength) << endl;
  return 0;
}