from math import sqrt


def square_number_list(n, current_list):
    if n == 0:
        return current_list
    base = int(sqrt(n))
    if base == sqrt(n):
        return current_list + [base]
    else:
        return square_number_list(n - base * base, current_list + [base])


def make_candidate_binary(candidate):
    current_binary = 0
    current_string = ""
    for number in candidate:
        for i in range(0, number):
            current_string += str(current_binary)
            if i < number - 1:
                current_binary = 0 if current_binary == 1 else 1
    return current_string


def permutation(num_list, current_list):
    result_list = []
    if num_list == []:
        return [current_list]
        # result_list.append(current_list)
    for i in range(len(num_list)):
        each_list = num_list.copy()
        each_list.pop(i)
        result_list = result_list + permutation(each_list, current_list + [num_list[i]])
    return result_list


n = int(input())
candidate = square_number_list(n, [])
candidates = permutation(candidate, [])
binary_strings = list(map(make_candidate_binary, candidates))

print(sorted(binary_strings)[0])