use std::collections::VecDeque;


const INF: usize = 1usize << 60;

fn main() {
    let mut n = String::new();
    std::io::stdin().read_line(&mut n).ok();
    let n: usize = n.trim().parse().unwrap();

    let mut dp = vec![vec![INF; n+1]; 200+1];
    dp[0][0] = 0;
    for i in 1..=200 {
        let length = i;
        let val = length * length;
        for j in 0..=n {
            if dp[i-1][j] < INF {
                dp[i][j] = dp[i][j].min(dp[i-1][j]);
            }
            if j >= val && dp[i-1][j-val] < INF {
                dp[i][j] = dp[i][j].min(dp[i-1][j-val] + length);
            }
            if j >= val && dp[i][j-val] < INF {
                dp[i][j] = dp[i][j].min(dp[i][j-val] + length);
            }
        }
    }
    let mut uses = vec![];
    let mut iidx = 200;
    let mut jidx = n;
    while jidx > 0 {
        while iidx * iidx <= jidx && dp[iidx][jidx] == iidx + dp[iidx][jidx-iidx*iidx] {
            jidx -= iidx * iidx;
            uses.push(iidx);
        }
        iidx -= 1;
    }
    uses.reverse();
    let odds = uses.iter().filter(|&&v| v % 2 == 1).copied().collect::<Vec<_>>();
    let mut evens = uses.iter().filter(|&&v| v % 2 == 0).copied().collect::<VecDeque<_>>();
    let mut result = String::new();
    for &v in odds.iter() {
        let val = format!("0{}", "10".repeat(v/2));
        result.push_str(&val);
    }
    let limit = evens.len();
    for i in 0..limit {
        let val = if i % 2 == 0 { evens.pop_back().unwrap() } else { evens.pop_front().unwrap() };
        let val = format!("{}", if i % 2 == 0 { "01".repeat(val/2) } else { "10".repeat(val/2) });
        result.push_str(&val);
    }
    println!("{}", result);
}