KURSCHAK 1974 Problem 2

$S_n$ is a square side $\frac{1}{n}$ . Find the smallest $k$ such that the squares $S_1, S_2,S_3, ...$ can be put into a square side $k$ without overlapping.