//#define NDEBUG #include #include #include #include namespace n91 { using i8 = std::int_fast8_t; using i32 = std::int_fast32_t; using i64 = std::int_fast64_t; using u8 = std::uint_fast8_t; using u32 = std::uint_fast32_t; using u64 = std::uint_fast64_t; using isize = std::ptrdiff_t; using usize = std::size_t; constexpr usize operator"" _z(unsigned long long x) noexcept { return static_cast(x); } class rep { const usize f, l; public: class itr { friend rep; usize i; constexpr itr(const usize x) noexcept : i(x) {} public: void operator++() noexcept { ++i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; constexpr rep(const usize first, const usize last) noexcept : f(first), l(last) {} constexpr itr begin() const noexcept { return itr(f); } constexpr itr end() const noexcept { return itr(l); } }; class revrep { const usize f, l; public: class itr { friend revrep; usize i; constexpr itr(usize x) noexcept : i(x) {} public: void operator++() noexcept { --i; } constexpr usize operator*() const noexcept { return i; } constexpr bool operator!=(const itr x) const noexcept { return i != x.i; } }; constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {} constexpr itr begin() const noexcept { return itr(l); } constexpr itr end() const noexcept { return itr(f); } }; template using vec_alias = std::vector; template auto md_vec(const usize n, const T &value) { return std::vector(n, value); } template auto md_vec(const usize n, Args... args) { return std::vector(n, md_vec(args...)); } template constexpr T difference(const T &a, const T &b) { return a < b ? b - a : a - b; } template T scan() { T ret; std::cin >> ret; return ret; } } // namespace n91 #include #include #include #include namespace n91 { void main_() { const usize n = scan(); std::string ans; std::vector dp(n + 1_z, std::numeric_limits::max()); for (const auto i : rep(1_z, n + 1_z)) { for (usize j = 1_z; j * j <= i; ++j) { dp[i] = std::min(dp[i], dp[i - j * j] + j); } } usize m = n; char next = '0'; constexpr char ex = '0' ^ '1'; while (m != 0_z) { usize c = [&]() { for (usize j = 1_z; j * j <= m; j += 2_z) { if (dp[m] == dp[m - j * j] + j) { return j; } } usize ret; for (usize j = 2_z; j * j <= m; j += 2_z) { if (dp[m] == dp[m - j * j] + j) { ret = j; } } return ret; }(); m -= c * c; for (const auto i : rep(0_z, c)) { ans.push_back(next); next ^= ex; } next ^= ex; } std::cout << ans << std::endl; } } // namespace n91 int main() { n91::main_(); return 0; }