#![allow(non_snake_case)]
#![allow(unused_imports)]
//use itertools::Itertools;
// use proconio::input;
// use proconio::marker::*;
use std::cmp::Reverse;
use std::collections::*;

fn main() {
    input! {
        n:usize,
    }
    const INF: usize = std::usize::MAX;

    let sqs = (1..).take_while(|&i| i * i <= n).collect::<Vec<_>>();
    let mut dp = vec![INF; n + 1];
    dp[0] = 0;
    for i in 0..n {
        if dp[i] == INF {
            continue;
        }

        for &sq in sqs.iter() {
            if i + sq * sq > n {
                break;
            }
            dp[i + sq * sq] = dp[i + sq * sq].min(dp[i] + sq);
        }
    }

    let mut lss = vec![];
    let mut q = VecDeque::new();
    q.push_back((vec![], n));
    while let Some((mut ls, yaba)) = q.pop_front() {
        if yaba == 0 {
            lss.push(ls.clone());
        }

        let prv = *ls.last().unwrap_or(&0);
        for &sq in sqs.iter() {
            if yaba < sq * sq {
                break;
            }
            if sq < prv {
                continue;
            }

            if dp[yaba - sq * sq] + sq == dp[yaba] {
                ls.push(sq);
                q.push_back((ls.clone(), yaba - sq * sq));
                ls.pop();
            }
        }
    }

    let mut ans = vec![];
    for mut ls in lss {
        ls.sort();
        let mut odd = ls
            .iter()
            .filter(|l| **l % 2 != 0)
            .copied()
            .collect::<VecDeque<_>>();
        let mut even = ls
            .iter()
            .filter(|l| **l % 2 == 0)
            .copied()
            .collect::<VecDeque<_>>();

        let mut bin = vec![0];
        while !odd.is_empty() || !even.is_empty() {
            let last = *bin.last().unwrap();
            if last == 0 {
                if let Some(l) = odd.pop_front() {
                    bin.append(&mut make(0, l));
                } else {
                    let l = even.pop_back().unwrap();
                    bin.append(&mut make(0, l));
                }
            } else {
                if let Some(l) = even.pop_front() {
                    bin.append(&mut make(1, l));
                } else {
                    let l = odd.pop_back().unwrap();
                    bin.append(&mut make(1, l));
                }
            }
        }

        bin.remove(0);
        ans = if ans.is_empty() { bin } else { ans.min(bin) }
    }

    for ans in ans {
        print!("{}", ans);
    }
    println!();
}

fn make(mut top: usize, l: usize) -> Vec<usize> {
    let mut res = vec![];
    for _ in 0..l {
        res.push(top);
        top = 1 - top;
    }

    res
}

mod input {
    #[macro_export]
    macro_rules! input {
        (source = $s:expr, $($r:tt)*) => {
            let mut iter = $s.split_whitespace();
            input_inner!{iter, $($r)*}
        };
        ($($r:tt)*) => {
            let s = {
                use std::io::Read;
                let mut s = String::new();
                std::io::stdin().read_to_string(&mut s).unwrap();
                s
            };
            let mut iter = s.split_whitespace();
            input_inner!{iter, $($r)*}
        };
    }

    #[macro_export]
    macro_rules! input_inner {
        ($iter:expr) => {};
        ($iter:expr, ) => {};

        ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
            let $var = read_value!($iter, $t);
            input_inner!{$iter $($r)*}
        };
    }

    #[macro_export]
    macro_rules! read_value {
        ($iter:expr, ( $($t:tt),* )) => {
            ( $(read_value!($iter, $t)),* )
        };

        ($iter:expr, [ $t:tt ; $len:expr ]) => {
            (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
        };

        ($iter:expr, chars) => {
            read_value!($iter, String).chars().collect::<Vec<char>>()
        };

        ($iter:expr, usize1) => {
            read_value!($iter, usize) - 1
        };

        ($iter:expr, $t:ty) => {
            $iter.next().unwrap().parse::<$t>().expect("Parse error")
        };
    }
}