use std::{collections::{VecDeque, BinaryHeap}, fmt::format, cmp::Reverse};

const INF: usize = 1usize << 60;

fn priority(val: usize) -> usize {
    if val % 2 == 1 {
        val
    } else {
        INF - val
    }
}

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![INF; n+1];
    dp[0] = 0;
    for i in 1..=n {
        for j in 1..=i {
            let val = j * j;
            if val > i { break; }
            dp[i] = dp[i].min(dp[i-val] + j);
        }
    }
    let mut uses = vec![];
    let mut target = n;
    while target > 0 {
        let mut pque = BinaryHeap::new();
        for i in 1.. {
            let val = i * i;
            if val > target { break; }
            if dp[target] == dp[target-val] + i {
                pque.push((Reverse(priority(i)), i));
            }
        }
        let (_, val) = pque.pop().unwrap();
        uses.push(val);
        target -= val * val;
    }
    uses.sort();
    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);
}