Find all integers nnn , n>1n>1n>1 , with the following property: for all kkk , 0≤k<n0\le k < n0≤k<n , there exists a multiple of nnn whose digits sum leaves a remainder of kkk when divided by nnn .