class Solution:

    def countElements(self, nums: List[int]) -> int:

        return sum(1 for x in nums if x != min(nums) and x != max(nums))

class Solution:

    def rearrangeArray(self, nums: List[int]) -> List[int]:

        pos = [x for x in nums if x > 0]

        neg = [x for x in nums if x < 0]

        ans = []

        for x in zip(pos, neg):

            ans.extend(x)

        return ans

class Solution:

    def findLonely(self, nums: List[int]) -> List[int]:

        ctr = Counter(nums)

        ans = []

        for k, v in ctr.items():

            if v == 1 and not ctr[k-1] and not ctr[k+1]:

                ans.append(k)

        return ans

class Solution:

    def maximumGood(self, statements: List[List[int]]) -> int:

        n = len(statements)

        ans = 0

        for s in range(2 ** n):

            state = [(s >> i) & 1 for i in range(n)]

            if all(state[i] == 0 or all(statements[i][j] == 2 or state[j] == statements[i][j] for j in range(n)) for i in range(n)):

                ans = max(ans, sum(state))

        return ans

class Solution:

    def maximumGood(self, smts: List[List[int]]) -> int:

        n, ans = len(smts), 0

        def valid(cur):

            return all(cur[i] == 0 or all(smts[i][j] == 2 or smts[i][j] == cur[j] for j in range(n)) for i in range(n))

        def dfs(cur, i, cnt):

            nonlocal ans

            if i == n:

                if valid(cur):

                    ans = max(ans, cnt)

                return

            cur.append(0)

            dfs(cur, i+1, cnt)

            cur[-1] = 1

            dfs(cur, i+1, cnt+1)

            cur.pop()

        dfs([], 0, 0)

        return ans