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 maxn = 1000000 + 10;
int pre[maxn];
int prefix(string s) {
  int m = s.size();
  pre[0] = -1, pre[1] = 0;
  int i = 1, len = 0;
  while (i < m) {
    if (s[i] == s[len]) {
      pre[i + 1] = ++len;
      i++;
    } else {
      if (len > 0)
        len = pre[len];
      else {
        pre[i + 1] = len;
        i++;
      }
    }
  }
  return pre[m];
}
bool kmp_search(string p, int k) {
  if (k > 0) {
    int n = p.size();
    for (int i = 1; i < n; i++)
      if (pre[i] >= k) return true;
  }
  return false;
}
bool check(int k, string s) {
  string hunt = s.substr(0, k);
  return kmp_search(s, k);
}
int main() {
  string s;
  cin >> s;
  string nw = s.substr(1, s.size() - 2);
  int x = prefix(s);
  bool tag = check(x, s);
  if (tag) {
    string ans = s.substr(0, x);
    cout << ans;
    return 0;
  }
  x = pre[x];
  while (x != -1) {
    tag = check(x, s);
    if (tag && x > 0) {
      for (int j = 0; j < x; j++) cout << s[j];
      return 0;
    }
    x = pre[x];
  }
  cout << "Just a legend";
  return 0;
}