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;
vector<int> zarray(string a, string p) {
  string s = p + '$' + a;
  vector<int> z(s.size());
  int n = s.size();
  int x = p.size();
  for (int i = 0; i < n; i++) z[i] = 0;
  int l = 0, r = 0;
  for (int i = 1; i < n; i++) {
    if (i > r) {
      l = i;
      r = i;
      while (r < n && s[r] == s[r - i]) r++;
      z[i] = r - l;
      r--;
    } else {
      int j = i - l;
      if (z[j] + i - 1 >= r) {
        l = i;
        while (r < n && s[r] == s[r - i]) r++;
        z[i] = r - l;
        r--;
      } else {
        z[i] = z[j];
      }
    }
  }
  return z;
}
int main() {
  string s;
  cin >> s;
  int n = s.size();
  vector<int> v1, v2;
  string x = s.substr(1, s.size());
  string y = x.substr(0, x.size() - 1);
  v1 = zarray(x, s);
  v2 = zarray(y, s);
  set<int> se;
  int m1 = -1, m2 = -1;
  for (int i = n + 1; i < v2.size(); i++) {
    m2 = max(m2, v2[i]);
  }
  for (int i = v1.size() - 1; i >= n + 1; i--) {
    if (v1.size() - i == v1[i] && v1[i] <= m2) {
      m1 = v1[i];
    }
  }
  if (m1 > 0)
    cout << s.substr(0, m1) << endl;
  else
    cout << "Just a legend" << endl;
  return 0;
}