OSN 2011 Problem 5

The image above is a net of a unit cube. Let $n$ be a positive integer, and let $2n$ such cubes are placed to build a $1 \times 2 \times n$ cuboid which is placed on a floor. Let $S$ be the sum of all numbers on the block visible (not facing the floor). Find the minimum value of $n$ such that there exists such cuboid and its placement on the floor so $S > 2011$ .