CF1096B.Substring Removal

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

You are given a string $s$ of length $n$ consisting only of lowercase Latin letters.

A substring of a string is a contiguous subsequence of that string. So, string "forces" is substring of string "codeforces", but string "coder" is not.

Your task is to calculate the number of ways to remove exactly one substring from this string in such a way that all remaining characters are equal (the number of distinct characters either zero or one).

It is guaranteed that there is at least two different characters in $s$ .

Note that you can remove the whole string and it is correct. Also note that you should remove at least one character.

Since the answer can be rather large (not very large though) print it modulo $998244353$ .

If you are Python programmer, consider using PyPy instead of Python when you submit your code.

输入格式

The first line of the input contains one integer $n$ ( $2 \le n \le 2 \cdot 10^5$ ) — the length of the string $s$ .

The second line of the input contains the string $s$ of length $n$ consisting only of lowercase Latin letters.

It is guaranteed that there is at least two different characters in $s$ .

输出格式

Print one integer — the number of ways modulo $998244353$ to remove exactly one substring from $s$ in such way that all remaining characters are equal.

输入输出样例

输入#1
```
4
abaa
```
输出#1
```
6
```
输入#2
```
7
aacdeee
```
输出#2
```
6
```
输入#3
```
2
az
```
输出#3
```
3
```

说明/提示

Let $s[l; r]$ be the substring of $s$ from the position $l$ to the position $r$ inclusive.

Then in the first example you can remove the following substrings:

$s[1; 2]$ ;
$s[1; 3]$ ;
$s[1; 4]$ ;
$s[2; 2]$ ;
$s[2; 3]$ ;
$s[2; 4]$ .

In the second example you can remove the following substrings:

$s[1; 4]$ ;
$s[1; 5]$ ;
$s[1; 6]$ ;
$s[1; 7]$ ;
$s[2; 7]$ ;
$s[3; 7]$ .

In the third example you can remove the following substrings:

$s[1; 1]$ ;
$s[1; 2]$ ;
$s[2; 2]$ .

首页