HW #7 sol

#pragma GCC optimize("O3")
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define double long double
#define _FastIO ios_base::sync_with_stdio(0); cin.tie(0)
#define F first
#define S second
const int mod = 998244353; // 1e9 + 7


signed main()
{
    _FastIO;


    /*
    // A
    int n;
    cin >> n;
    int k = sqrtl(n);
    cout << k * k << '\n';
    */
    /*
    // B
    string a , b;
    cin >> a >> b;
    a += b;
    int n = stoll(a);
    int k = sqrtl(n);
    if(k * k == n)
        cout << "Yes";
    else
        cout << "No";
    */
    /*
    // C
    int n;
    cin >> n;
    while(n % 2 == 0)
        n /= 2;

    while(n % 3 == 0)
        n /= 3;

    cout << (n == 1 ? "Yes": "No") << '\n';
    */
 //  (N - x) % mod == 0
    // (N - N % mod) % mod == 0
    // E
    /*
    int n;
    cin >> n;
    int x = n % mod;
    if(x < 0)
        x += mod;

    cout << x << '\n';
    */

    /*
    (-12 - 3) % 5 == 0
    0 <= x < 5

    (12 - 2)
    */
    /*
    // E
    string s;
    cin >> s;
    int cnt = 0 , ans = 0;
    for(char i : s){
        if(i == 'A' || i == 'G' || i == 'C' || i == 'T')
            cnt++;
        else
            cnt = 0;

        ans = max(ans , cnt);

    }

    cout << ans << '\n';
    */
    /*
    // F
    string s;
    cin >> s;
    map<char , int> cnt;
    for(char i : s)
        cnt[i]++;

    map<int , int> dif;

    for(auto i : cnt)
        dif[i.S]++;

    string ans = "Yes";
    for(int i = 1; i <= s.size(); i++){
        if(dif[i] != 0 && dif[i] != 2)
            ans = "No";
    }
    cout << ans << '\n';
    */
    /*
    // G
    int n;
    cin >> n;
    string s;
    cin >> s;

    for(int i = 1; i < n; i++){
        int k = 0;
        while(k + i < n && s[k] != s[k + i])
            k++;

        cout << k << '\n';
    }
    */
}