Each cell of an infinite table (infinite in all directions) is colored with one of $n$ given colors. All six cells of any $2\times 3$ (or $3 \times 2$) rectangle have different colors. Find the smallest possible value of $n$.
Source: Bulgaria JBMO TST 2018, Day 1, Problem 4
Tags: combinatorics, inequalities
Each cell of an infinite table (infinite in all directions) is colored with one of $n$ given colors. All six cells of any $2\times 3$ (or $3 \times 2$) rectangle have different colors. Find the smallest possible value of $n$.