Problem:
Score : 100 points

Problem Statement

You are given a 4-character string S consisting of uppercase English letters.
Determine if S consists of exactly two kinds of characters which both appear twice in S.

Constraints

The length of S is 4.

S consists of uppercase English letters.

Input

Input is given from Standard Input in the following format:

S

Output

If S consists of exactly two kinds of characters which both appear twice in S, print Yes; otherwise, print No.

Sample Input 1

ASSA

Sample Output 1

Yes

S consists of A and S which both appear twice in S.

Sample Input 2

STOP

Sample Output 2

No

Sample Input 3

FFEE

Sample Output 3

Yes

Sample Input 4

FREE

Sample Output 4

No

Solution in Rust (1.42.0) (judge verdict: Accepted)

#![allow(non_snake_case)]
#![allow(unused_imports)]
use proconio::input;
use std::collections::HashMap;
// use std::collections::VecDeque;
// use std::cmp::max;
// use std::cmp::min;

fn main() {
    input! {
        S: String,
    }

    let mut chars: Vec<char> = S.chars().collect();
    chars.sort();

    let ans = if chars[0] == chars[1] && chars[2] == chars[3] && chars[0] != chars[2] {
        "Yes"
    } else {
        "No"
    };

    println!("{}", ans);
}