**Compilation/Execution Result:**

You are given a sorted array containing only numbers 0 and 1. Find the transition point efficiently. Transition point is a point where "0" ends and "1" begins.

**Input:**

You have to complete the method which takes 2 argument: the array arr[] and size of array N. You should not read any input from stdin/console. There are multiple test cases. For each test cases, this method will be called individually.

**Output:**

Your function should return transition point.

**Constraints:**

1 ≤ T ≤ 100

1 ≤ N ≤ 500000

0 ≤ C[i] ≤ 1

**Example:**

Input

1

5

0 0 0 1 1

Output

3

Author: rajatjha

Shashank_Pathak | 200 |

surbhi_7 | 168 |

yati493 | 167 |

SANJAY5797 | 164 |

dark_knights | 162 |

surbhi_7 | 556 |

Shashank_Pathak | 556 |

dark_knights | 501 |

Infinty | 341 |

Vasudha Gupta | 308 |

akhayrutdinov | 4156 |

sanjay05 | 3597 |

Quandray | 2778 |

Ibrahim Nash | 2475 |

Michael Riegger | 2280 |