Supose $f$ is a polynomial with coefficients in $\mathbb{Z}$ such that $f(a_1) = f(a_2) = f(a_3) = f(a_4) = 1$ where $a_1 < \dots < a_4 \in \mathbb{Z}$. Assume that $f(c) = -1$ for some integer $c$.
Set $g(x) = f(x) - 1$, then $g(a_i) = 0$, and also $g(c) = -2$.
Consequently we may factor $g(x) = (x-a_1)(x-a_2)(x-a_3)(x-a_4)h(x)$ where $h$ is another polynomial. Now $h$ has integer coefficients as well, since it is obtained by repeated applications of the Euclidean Algorithm. Substitute $x = c$ to obtain
$$
-2 = (c-a_1)(c-a_2)(c-a_3)(c-a_4)h(c)
$$
and all factors are integers. The first four factors are all different. That is impossible since their product would be at least 4 in absolute value.
Note that $f(x) = x^3 - 7x^2 + 14x - 7$ indeed satisfies $f(1) = f(2) = f(4) = 1$ and $f(3) = -1$. So there have to be at least four $a_i$ with $f(a_i) = 1$.