n = gets.to_i

MOD = 1004535809
a = (n * 2) % MOD
b = n % MOD

n2 = ("%#b" % n)
n2 = n2.slice(2...n2.size)

def modpow(a, b)
    return 1 if b == 0
    res = modpow(a * a % MOD, b / 2)
    res = res * a % MOD if b.odd?
    res
end

inv = modpow(2, MOD - 2)

ans = 0
n2.reverse!

(0...n2.size).each {|i|
    ans = (ans + b) % MOD
    if n2[i].to_i == 1
        b -= 1
    end
    b = b * inv % MOD
}

ans = (a - ans) % MOD
ans += MOD if a < 0

puts(ans)