{"problem":{"name":"ABC Identity","description":{"content":"You are given a string $S$ of length $3N$, containing exactly $N$ letters `A`, $N$ letters `B`, and $N$ letters `C`. Let's call a string $T$ consisting of letters `A`, `B`, and `C` **good**, if the fo","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"agc055_a"},"statements":[{"statement_type":"Markdown","content":"You are given a string $S$ of length $3N$, containing exactly $N$ letters `A`, $N$ letters `B`, and $N$ letters `C`.\nLet's call a string $T$ consisting of letters `A`, `B`, and `C` **good**, if the following conditions hold:\n\n*   The length of $T$ is divisible by $3$. Let's denote it by $3K$.\n*   $T_1 = T_2 = \\ldots = T_K$\n*   $T_{K+1} = T_{K+2} = \\ldots = T_{2K}$\n*   $T_{2K+1} = T_{2K+2} = \\ldots = T_{3K}$.\n*   Letters $T_1, T_{K+1}$ and $T_{2K+1}$ are different from each other.\n\nExamples of good strings are `ABC`, `BBAACC`, and `AAACCCBBB`.\nFind a way to split $S$ into **at most $6$** (not necessarily contiguous) subsequences so that the letters from each subsequence form a good string.\nIt can be proved that, under the constraints of the problem, it's always possible.\n\n## Constraints\n\n*   $1 \\le N \\le 2\\cdot 10^5$\n*   The string $S$ contains $N$ letters `A`, $N$ letters `B`, and $N$ letters `C`.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"agc055_a","tags":[],"sample_group":[["2\nABCCBA","111222\n\n$S$ is split into subsequences `ABC` and `CBA`, and each of them is a good string."],["4\nAABCBCAACBCB","111211241244\n\nPositions of $1$ form a subsequence `AABBCC`, positions of $2$ form a subsequence `CAB`, and positions of $4$ form a subsequence `ACB`. All of these strings are good."]],"created_at":"2026-03-03 11:01:14"}}