Littlewood proved that, contrary to then popular belief, there were infinitely many integers $n$ such that there were more primes less than $n$ congruent to $3 \pmod{4}$ than to $1$.
The first such $n$ (which I do not know, but which is probably known) would be an answer to this question.
This abstract of Carter Bays and Richard H. Hudson's On the Fluctuations of Littlewood for Primes of the Form $4n \pm 1$ suggests some other candidates.
Let $\pi_{b,c}(x)$ denote the number of primes $\leqslant x$ which are
$\equiv c (\operatorname{mod} b)$. Among the first 950,000,000
integers there are only a few thousand integers $n$ with $\pi_{4,3}(n)
> < \pi_{4,1}(n)$. The authors find three new widely spaced regions
containing hundreds of millions of such integers; the density of these
integers and the spacing of the regions is of some importance because
of their intimate connection with the truth or falsity of the analogue
of the Riemann hypothesis for $L(s)$. The discovery that the majority
of all integers $n$ less than $2 \times 10^{10}$ with $\pi_{4,3}(n) <
> \pi_{4,1}(n)$ are the 410,000,000 (consecutive) integers lying between
18,540,000,000 and 18,950,000,000 is a major surprise; results are
carefully corroborated and some of the implications are discussed.
On the same topic, from the same paper, reported in Wolfram
Similarly, consider the list of the first n primes {p_3,p_4,...,p_n} (mod 3),
skipping p_1=2 and p_2=3 since 3=0 (mod 3). This list contains equal numbers of
remainders 2 and 1 at the values n=4, 6, 8, 12, 14, 22, 38, 48, 50, ... (OEIS A096629).
The first value of n for which the list is biased towards 1 is n=23338590792, as first found by
Bays and Hudson in 1978 (Derbyshire 2004, p. 126), giving the first few such values as
23338590792, 23338590794, 23338590795, 23338590796, ... (OEIS A096630).