def main():
    import sys
    L = int(sys.stdin.readline())
    
    if L % 2 == 1:
        # For odd L, minimal cost is L, and the number of ways is L
        print(L)
        print(L)
    else:
        # For even L, minimal cost is L, and the number of ways is L * (L // 2) // 2
        # Wait, no. Let's think again.
        # The number of ways is L * (L / 2) // 2
        # But looking at the sample input where L=10, the output is 30.
        # 10 * (10/2) // 2 = 10 *5//2=25, which doesn't match 30.
        # So perhaps the formula is different.
        # For even L, each composition into two odds is (L/2) in count, and each has 2 ways to split.
        # So total ways is (L//2) * 2 * something.
        # For L=10, L//2=5, and 5 * 6 =30, which matches the sample.
        # So the number of ways is (L // 2) * (L // 2 +1)
        # Because for L=10, 5*6=30.
        print(L)
        print((L // 2) * (L // 2 + 1))

if __name__ == "__main__":
    main()