import Data.List (sort)

isKadomatsu :: [Int] -> Bool
isKadomatsu (a : b : c : _) = (q == a || q == c) && a /= b && b /= c && c /= a
    where [p, q, r] = sort [a, b, c]

adjacentElements :: Int -> [a] -> [[a]]
adjacentElements = adjacentElements' []
    where
        adjacentElements' ys n xs@(_ : xr)
            | length xs >= n = adjacentElements' (ys ++ [take n xs]) n xr
            | otherwise      = ys

main :: IO ()
main = getLine >> getLine >>= print . length .
    filter isKadomatsu . adjacentElements 3 . map read . words