import math
import sys

def main():
    L = int(sys.stdin.readline())
    max_sum_abc = L // 4
    if max_sum_abc < 12:  # 最小的原始勾股数对sum_abc是12，当L < 48时无法满足
        print(0)
        return
    count = 0
    max_m = int(math.sqrt(max_sum_abc)) + 2  # 确保覆盖所有可能的m
    for m in range(2, max_m + 1):
        for n in range(1, m):
            if math.gcd(m, n) != 1:
                continue
            if (m % 2) == (n % 2):
                continue  # 必须一个奇数一个偶数
            current_sum = 2 * m * (m + n)
            if current_sum > max_sum_abc:
                continue
            count += 1
    print(count % 1000003)

if __name__ == '__main__':
    main()