In a row of trees, the i-th tree produces fruit with type tree[i].
You start at any tree of your choice, then repeatedly perform the following steps:

Add one piece of fruit from this tree to your baskets.  If you cannot, stop.
Move to the next tree to the right of the current tree.  If there is no tree to the right, stop.

Note that you do not have any choice after the initial choice of starting tree: you must perform step 1, then step 2, then back to step 1, then step 2, and so on until you stop.
You have two baskets, and each basket can carry any quantity of fruit, but you want each basket to only carry one type of fruit each.
What is the total amount of fruit you can collect with this procedure?
 
Example 1:
Input: [1,2,1]
Output: 3
Explanation: We can collect [1,2,1].


Example 2:
Input: [0,1,2,2]
Output: 3
Explanation: We can collect [1,2,2].
If we started at the first tree, we would only collect [0, 1].


Example 3:
Input: [1,2,3,2,2]
Output: 4
Explanation: We can collect [2,3,2,2].
If we started at the first tree, we would only collect [1, 2].


Example 4:
Input: [3,3,3,1,2,1,1,2,3,3,4]
Output: 5
Explanation: We can collect [1,2,1,1,2].
If we started at the first tree or the eighth tree, we would only collect 4 fruits.

 



Note:

1 <= tree.length <= 40000
0 <= tree[i] < tree.length

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    def totalFruit(self, tree: List[int]) -> int:\n        #You want a basket that can get both. \n        total_fruits = collections.defaultdict(int)\n        unique_baskets = 0\n        max_fruit_types = 0 \n        start = 0\n        for end in range(len(tree)):\n            cur_fruit = tree[end]\n            total_fruits[cur_fruit] += 1 \n            if total_fruits[cur_fruit] == 1: #then we know there is a unique fruit here\n                unique_baskets += 1 \n                \n            while unique_baskets >= 3: \n                start_fruit = tree[start]\n                total_fruits[start_fruit] -= 1\n                if not total_fruits: #this means that we have less unique baskets now \n                    unique_baskets -= 1 \n                start += 1\n                    \n            max_fruit_types = max(max_fruit_types, end - start + 1)\n            \n        return max_fruit_types\n            \n#         #Start at ANY tree of my choice \n#         #Then perform the steps \n# #         1) Add one fruit from the tree to basket. If you can\'t you stp \n# #         2) Move to the next tree to the RIGHT of the current tree if there is no such tree you stop. \n        \n#     #So you reset back to step 1 after you\'re done. \n#     #So this means that once you\'re done and because we want to GET all possible fruits through your positions \n# #         WANT: Total amount of fruit collected \n#         last_fruit = -1 \n#         second_last_fruit = -1 \n#         last_fruit_count = 0\n#         total_fruits = 0 \n#         cur_fruits_max = 0 \n#         #Let\'s call prev fruits \n#         #last_fruit, second_last_fruit \n#         # fruit is our CURRENT fruit \n        \n#         #So we have 2 prev fruit and current fruit.  \n#         #If fruit is the second_last_fruit \n#         #We will know \n#         for fruit in tree: \n#             if fruit == last_fruit or fruit == second_last_fruit: \n#                 cur_fruits_max += 1 \n                \n#             else: \n#                 cur_fruits_max = last_fruit_count + 1 #this means we picked you new fruit \n                \n     \n#             #You need to check fruit with last fruit not second to last fruit since last fruit will be your \\"best case scenario\\"\n#             if fruit == last_fruit: \n#                 last_fruit_count += 1 \n#             else: \n#                 last_fruit_count = 1 #never been seen before (base case)\n            \n#             #This means that we\'d be double counting if we moved you beforehand \n#             if fruit != last_fruit: #meaning your a second_last_fruit basically \n#                 second_last_fruit = last_fruit \n#                 last_fruit = fruit \n                \n#             total_fruits = max(total_fruits, cur_fruits_max)\n            \n#         print(total_fruits)\n#         # (O(N)) run time \n#         return total_fruits \nclass Solution():\n    def totalFruit(self, tree):\n        fruit_basket = collections.defaultdict(int)\n        unique_fruits = 0 \n        total_fruits = 0 \n        start = 0\n        end = 0 \n        for end in range(len(tree)): \n            type_of_fruit = tree[end]\n            fruit_basket[type_of_fruit] += 1 #Defaultdict so if not there instantiate it and add one \n            #small check to count it one time for the fruit \n            if fruit_basket[type_of_fruit] == 1: \n                unique_fruits += 1 \n                \n            while unique_fruits > 2:\n                start_fruit = tree[start]\n                fruit_basket[start_fruit] -= 1 \n                if not fruit_basket[start_fruit]: #meaning it\'s empty \n                    unique_fruits -= 1 \n                start += 1 \n            total_fruits = max(total_fruits, end - start + 1)\n        return total_fruits\n        \n#Map Way   \n# import collections\n# class Solution():\n#     def totalFruit(self, tree):\n#         count = collections.defaultdict(int)\n#         unique = res = end = start = 0\n#         while end < len(tree):\n#             count[tree[end]] += 1\n#             if count[tree[end]] == 1: unique+=1\n#             while unique > 2:\n#                 count[tree[start]] -= 1\n#                 if not count[tree[start]]: \n#                     unique -= 1\n#                 start += 1\n#             res = max(res, end - start + 1)\n#             end += 1\n#         return res\n            \n                \n        \n        \n        \n            \n            \n            \n\n\n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'totalFruit'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 5640