import sys # sys.stdin.readline() from collections import deque sys.setrecursionlimit(100000000) import heapq import copy import itertools from itertools import combinations from itertools import permutations INF = 1e9 def findElem(x): n = len(arr) a = findFirstElem(0,n-1) b = findSecondElem(0,n-1) if a == None: return 0 else: return b-a+1 def findFirstElem(start,end): if start > end: return Non..