suppose we have an array of N natural numbers and asks him to solve the following queries:-

Query a:- modify the element present at index i to x.

Query b:- count the number of even numbers in range l to r inclusive.

Query c:- count the number of odd numbers in range l to r inclusive.

**input:**

First line of the input contains the number N. Next line contains N natural numbers.Next line contains an integer Q followed by Q queries.

a x y - modify the number at index x to y.

b x y - count the number of even numbers in range l to r inclusive.

c x y - count the number of odd numbers in range l to r inclusive.

I tried to solve using simple arrays but it isn't doing well for big constraints so I thought to use other DS with efficient algorithm so please explain appropriate algorithm.Thanks in advance.