Abstract: We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes in a dyadic interval for which a given interval does not contain a quadratic non-residue modulo . The bound is non-trivial for any function as . This is an analogue of the well-known estimates on the smallest quadratic non-residue modulo on average over primes , which corresponds to the choice .