class Integer
    def factorial
        return 1 if self == 0
        (1..self).inject(:*)
    end

    def permutation(k)
        self.factorial/(self-k).factorial
    end

    def combination(k)
        self.factorial/((self-k).factorial*k.factorial)
    end
end
x = gets.to_i
    def cal(x)
        if x == 0
            puts "#{1} #{0}"
            return
        elsif x > 31
            puts "#{0} #{0}"
            return
        end

        n = 31.combination(x)
        sum = (2**31 -1) * 30.combination(x-1)
        puts "#{n} #{sum}"
    end
    cal(x)