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;
template <typename T, typename L>
bool smax(T &x, L y) {
  return x < y ? (x = y, true) : false;
}
template <typename T, typename L>
bool smin(T &x, L y) {
  return y < x ? (x = y, true) : false;
}
void calc();
const int MAXN = 1e6 + 15;
string s;
bool can;
int f[MAXN];
vector<int> vec;
int main() {
  ios_base::sync_with_stdio(false), cin.tie(NULL), cout.tie(NULL);
  cerr << "HELLO WORLD :|\n";
  cin >> s;
  calc();
  int v = f[s.size()];
  while (true) {
    if (v <= 0) return cout << "Just a legend\n", false;
    for (int j = 1; j < (int)s.size(); j++) {
      if (f[j] == v) return cout << s.substr(0, v) << '\n', false;
    }
    v = f[v];
  }
}
void calc() {
  memset(f, false, sizeof f);
  int len = 0;
  string t = s;
  f[0] = -1;
  for (int i = 1; i <= (int)t.size(); i++) {
    len = f[i - 1];
    while (~len) {
      if (t[len] == t[i - 1]) break;
      len = f[len];
    }
    f[i] = len + 1;
  }
}