MK-MO 2017 Problem 1

Find all functions $f:\mathbb{N} \to \mathbb{N}$ such that for each natural integer $n>1$ and for all $x,y \in \mathbb{N}$ the following holds: $$f(x+y) = f(x) + f(y) + \sum_{k=1}^{n-1} \binom{n}{k}x^{n-k}y^k$$