#include <stdio.h>
 
int main(void) {
    int n;
    int binary[32];             // 2進数の各桁（余り）を格納する配列。32要素あればintの最大桁数に対応可能
    int i = 0;
 
    scanf("%d", &n);
 
    while (n > 0) {
        binary[i] = n % 2; 
        n = n / 2;          // numを2で割った「商」で更新する
        i++;                     // 添字を1増やす。次の余りは次の配列要素に
    }
 
    for (int j = i - 1; j >= 0; j--) {
        printf("%d", binary[j]);
    }
    printf("\n");
 
    return 0;
}

I2luY2x1ZGUgPHN0ZGlvLmg+CgppbnQgbWFpbih2b2lkKSB7CiAgICBpbnQgbjsKICAgIGludCBiaW5hcnlbMzJdOyAgICAgICAgICAgICAvLyAy6YCy5pWw44Gu5ZCE5qGB77yI5L2Z44KK77yJ44KS5qC857SN44GZ44KL6YWN5YiX44CCMzLopoHntKDjgYLjgozjgbBpbnTjga7mnIDlpKfmoYHmlbDjgavlr77lv5zlj6/og70KICAgIGludCBpID0gMDsKCiAgICBzY2FuZigiJWQiLCAmbik7CgogICAgd2hpbGUgKG4gPiAwKSB7CiAgICAgICAgYmluYXJ5W2ldID0gbiAlIDI7IAogICAgICAgIG4gPSBuIC8gMjsgICAgICAgICAgLy8gbnVt44KSMuOBp+WJsuOBo+OBn+OAjOWVhuOAjeOBp+abtOaWsOOBmeOCiwogICAgICAgIGkrKzsgICAgICAgICAgICAgICAgICAgICAvLyDmt7vlrZfjgpIx5aKX44KE44GZ44CC5qyh44Gu5L2Z44KK44Gv5qyh44Gu6YWN5YiX6KaB57Sg44GrCiAgICB9CgogICAgZm9yIChpbnQgaiA9IGkgLSAxOyBqID49IDA7IGotLSkgewogICAgICAgIHByaW50ZigiJWQiLCBiaW5hcnlbal0pOwogICAgfQogICAgcHJpbnRmKCJcbiIpOwoKICAgIHJldHVybiAwOwp9

MTc3

177