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;
void z_function(string const& s, int* z) {
  int n = (int)s.length();
  for (int i = 1, l = 0, r = 0; i < n; ++i) {
    if (i <= r) z[i] = min(r - i + 1, z[i - l]);
    while (i + z[i] < n && s[z[i]] == s[i + z[i]]) ++z[i];
    if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
  }
}
int zArr[1000009];
struct data {
  int val, ind;
  data() { ; }
  data(int y, int x) {
    val = x;
    ind = y;
  }
};
vector<data> v;
bool cmp(data a, data b) {
  if (a.val == b.val) return a.ind < b.ind;
  return a.val > b.val;
}
int main() {
  ios_base ::sync_with_stdio(false);
  cin.tie(NULL);
  string str;
  cin >> str;
  if (str.size() <= 2) {
    cout << "Just a legend" << endl;
    return 0;
  }
  z_function(str, zArr);
  for (int i = 1; i < str.size(); i++) {
    if (zArr[i] != 0) v.push_back(data(i, zArr[i]));
  }
  sort(v.begin(), v.end(), cmp);
  int x = 0;
  for (int i = 1; i < v.size(); i++) {
    if (v[i].ind + v[i].val == str.size()) {
      for (int j = 0; j < v[i].val; j++) cout << str[j];
      cout << endl;
      return 0;
    }
  }
  cout << "Just a legend" << endl;
}