stablegradients/pie-gem5-pairs huggingface dataset:
// Slower C++ solution:
#include <stdio.h>

#include <cmath>

#include <algorithm>

#include <bits/stdc++.h>

const int maxn = 1e5 + 10;

using namespace std;

int main()

{

    int n, x;

    long long a[maxn] = {0};

    cin >> n >> x;

    long long  count = 0;

    for (int i = 0; i < n; i++)

        scanf("%lld", &a[i]);

    for (int i = 0; i < n; i++)

    {

        if (a[i] > x)

        {

            count += (a[i] - x);

            a[i] = x;

        }

        if (a[i] + a[i+1] > x)

        {

            count += (a[i+1] + a[i] - x);

            a[i+1] = a[i+1] - (a[i+1] + a[i] - x);

        }

    }

    cout << count << endl;

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.7782946280212721x):
// #define _GLIBCXX_DEBUG

#include <bits/stdc++.h>

using namespace std;

#define uint unsigned int

#define ull  unsigned long long

typedef string str;

typedef long long ll;

typedef double db;

typedef pair<int, int> pii;

typedef map<int, int> mii;

typedef vector<int> vi;

typedef vector<bool> vb;

#define pb push_back

#define fi first

#define se second

#define in insert

#define all(x) (x).begin(), (x).end()

#define rall(x) (x).rbegin(), (x).rend()

#define speed ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0)

const int INF = 1e9 + 5;

const int N = 2e5 + 123;

int main(){

    speed;

    int n, x;

    cin >> n >> x;

    vi v(n);

    for(int i = 0; i < n; ++i){

        cin >> v[i];

    }

    ll ans = 0;

    if(v[0] > x){

        ans += v[0] - x;

        v[0] = x;

    }

    for(int i = 1; i < n; ++i){

        if(v[i] + v[i - 1] > x){

            ans += v[i] + v[i - 1] - x;

            v[i] -= v[i] + v[i - 1] - x;

        }

    }

    cout << ans;

}
// Slower C++ solution:
#include <iostream>

#include <algorithm>



typedef long long ll;



using namespace std;



int main() {

    ll n, x, cnt = 0, prev = 0, now;

    cin >> n >> x;

    for (ll i = 0; i < n; ++i) {

        cin >> now;

        prev = now - max(prev + now - x, 0LL);

        cnt += now - prev;

    }

    cout << cnt << endl;

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.231022860706934x):
#include <cstdio>

#include <algorithm>



typedef long long ll;



using namespace std;



int main() {

    ll n, x, cnt = 0, prev = 0, now;

    scanf("%lld%lld", &n, &x);

    for (ll i = 0; i < n; ++i) {

        scanf("%lld", &now);

        prev = now - max(prev + now - x, 0LL);

        cnt += now - prev;

    }

    printf("%lld\n", cnt);

    return 0;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



typedef long long int64;





int main()

{

  int64 N, x, A[100001] = {};



  cin >> N >> x;

  for(int i = 0; i < N; i++) {

    cin >> A[i];

  }



  int64 ret = 0;

  for(int i = 1; i <= N; i++) {

    ret += min(A[i], max(0LL, A[i - 1] + A[i] - x));

    A[i] -= min(A[i], max(0LL, A[i - 1] + A[i] - x));

    ret += max(0LL, A[i - 1] + A[i] - x);

  }



  cout << ret << endl;

}

// Faster C++ solution for the same problem (measured speedup: 1.77105524822272x):
#include<bits/stdc++.h>



using namespace std;



using int64 = long long;

const int mod = 1e9 + 7;

const int inf = (1 << 30) - 1;

const int64 infll = (1LL << 61) - 1;



struct IoSetup {

  IoSetup() {

    cin.tie(nullptr);

    ios::sync_with_stdio(false);

    cout << fixed << setprecision(10);

    cerr << fixed << setprecision(10);

  }

} iosetup;



template< typename T >

ostream &operator<<(ostream &os, const vector< T > &v) {

  for(int i = 0; i < (int) v.size(); i++) {

    os << v[i] << (i + 1 != v.size() ? " " : "");

  }

  return os;

}



template< typename T >

istream &operator>>(istream &is, vector< T > &v) {

  for(T &in : v) is >> in;

  return is;

}



template< typename T1, typename T2 >

inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }



template< typename T1, typename T2 >

inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }



template< typename T = int64 >

vector< T > make_v(size_t a) {

  return vector< T >(a);

}



template< typename T, typename... Ts >

auto make_v(size_t a, Ts... ts) {

  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));

}



template< typename T, typename V >

typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {

  t = v;

}



template< typename T, typename V >

typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {

  for(auto &e : t) fill_v(e, v);

}



int main() {

  int N, X;

  cin >> N >> X;

  vector< int > A(N);

  cin >> A;



  int64 ret = 0;

  for(int i = 0; i < A.size(); i++) {

    int more = max(0, A[i] - X);

    ret += more;

    A[i] -= more;

  }



  for(int i = 1; i < A.size(); i++) {

    int more = max(0, A[i] + A[i - 1] - X);

    ret += more;

    A[i] -= more;

  }



  cout << ret << endl;

}
// Slower C++ solution:
#include <bits/stdc++.h>



using namespace std;



int main() {

    string s;

    cin >> s;

    int cnt[26] = {0};

    for (int i = 0; i < s.size(); i++) {

        cnt[s[i] - 'a']++;

    }

    for (int i = 0; i < 26; i++) {

        if (cnt[i] & 1) {

            puts("No");

            return 0;

        }

    }

    puts("Yes");

    return 0;

}


// Faster C++ solution for the same problem (measured speedup: 5.292638753979449x):
#include<stdio.h>

#include<string.h>

int main()

{

    int j,n,flag,count;

    char w[100]={0},i;

    scanf("%s",w);

    flag=0;

    n=strlen(w);

    for(i=97;i<='z';i++)

    {

        count=0;

        for(j=0;j<n;j++)

            if(w[j]==i)

                count++;

        if(count%2!=0)

        {

            flag=1;

            break;

        }

    }

        if(flag==1)

        printf("No\n");

        else

    printf("Yes\n");

    return 0;

}
// Slower C++ solution:
#include<bits/stdc++.h>

using namespace std;

int main()

{

    string w;

    getline(cin,w);

    int len=w.size();

    int a[26]={0};

    int T=0;

    for(int i=0;i<len;i++)

        a[w[i]-97]++;

    for(int i=0;i<25;i++)

        if(a[i]%2!=0){

           T=1;

         break;

        }

    if(T==0)

        printf("Yes\n");

    else

        printf("No\n");



}

// Faster C++ solution for the same problem (measured speedup: 5.332810349297376x):
#include <cstdio>

#include <algorithm>

#include <cstring>

#define INF 0x3f3f3f3f

using namespace std;

int num[30];

char ar[105];



int main()

{

    while(~scanf(" %s",ar)){

        int len = strlen(ar);

        for(int i=0;i<len;i++){

            num[ar[i]-'a']++;

        }

        bool flag = true;

        for(int i=0;i<26;i++){

            if(num[i]%2 != 0){

                flag = false;

                break;

            }

        }

        if(flag){

            printf("Yes\n");

        }

        else

            printf("No\n");



    }

    return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.8093516993728256x):
#include<bits/stdc++.h>

using namespace std;

int main()

{

string str;

map<char,int>mp;

map<char,int>::iterator itr;

int i;

cin>>str;

for(i=0;i<str.size();i++)

{

if(mp.find(str[i])==mp.end())

mp[str[i]]=1;

else mp[str[i]]++;

}

int flag=0;

for(itr=mp.begin();itr!=mp.end();itr++)

{

if(itr->second%2==1)

{cout<<"No"<<endl;exit(0);}



}

cout<<"Yes"<<endl;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.8359335077566048x):
#include<bits/stdc++.h>

typedef long long ll;

#define endl "\n"



using namespace std;



//ll const N = 32000;

int cnt[26];



int main()

{

    string w;

    int flag = 0;



    cin >> w;



    for(int i = 0; i < w.size(); i++)

    {

        cnt[w[i] - 97]++;

    }





    for(int i = 0; i < 26; i++)

    {

        if(cnt[i] % 2 != 0)

        {

            flag++;

            break;

        }

    }



    if(flag == 0)printf("Yes\n");

    else printf("No\n");



    return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.7832437963587142x):
#include <bits/stdc++.h>

using namespace std;



typedef long long ll;



map <int, int> m;



int main(void)

{

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);



    //freopen("input.txt", "r", stdin);



    string s;

    getline(cin, s);



    for(int i = 0; i < s.size(); i++)

    {

        m[s[i] - 'a']++;

    }



    for(auto it = m.begin(); it != m.end(); it++)

    {

        if(it -> second % 2 != 0)

        {

            cout << "No\n";

            return 0;

        }

    }

    cout << "Yes\n";







    return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.7833102192710384x):
#include <bits/stdc++.h>

using namespace std;



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    

    map<char,int>mp;

    

    string n;

    cin>>n;

    

    for(int i=0;i<n.size();i++)

    	mp[n[i]]++;

    

    bool flag =false;

    

    for(auto x:mp)

    {

    	if(x.second%2==0)

    		flag=true;

    	else if(x.second%2!=0)

    	{	flag=false;

    		break;}

    }

    if(flag==true)

    	cout<<"Yes";

    else

    	cout<<"No";

    

    

    

    

	return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.8166999488378341x):
#include<bits/stdc++.h>

using  namespace  std;

int main() {



    string str;

    cin>>str;



    sort(str.begin(),str.end());



    int count = 1;

    bool flag = true;

    for(int i=0;i<str.size()-2 && flag;i++){



        if(str[i]==str[i+1]){

            count++;

            continue;

        }

        if(count%2==0){

            count=1;



        }

        else{

            flag = false;

        }

    }



    if(flag){

        cout<<"Yes";

    }

    else{

        cout<<"No";

    }





    return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.789401865379622x):
#include <bits/stdc++.h>

#define ll long long

#define endl "\n"

#define the_flash ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)

#define input_output freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout)



using namespace std;



int main()

{

	//input_output;

	the_flash;

	string w;

	cin >> w;

	for (char ch = 'a'; ch <= 'z'; ch++)

	{

		int count = 0;



		for (int i = 0; i < w.length(); i++)

		{

			if (w[i] == ch)

				count++;

		}



		if (count % 2 == 1)

		{

			cout << "No" << endl;

			return 0;

		}

	}



	cout << "Yes" << endl;

	return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.8025875014308717x):
#include<bits/stdc++.h>

using namespace std;



#define ll long long

#define fast_io ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);

int freq[122];

int main()

{

    fast_io;

    string w;

    cin >> w;

    int n = w.size();

    for(int i = 0; i < n ;i++)

    {

        freq[w[i]]++;

    }

    int cnt = 0;

    for(int i = 0; i < 122; i++)

    {

        if(freq[i] % 2 != 0)

        {

            cnt++;

            break;

        }

    }

    if(cnt > 0)

    {

        cout << "No\n";

    }

    else{

        cout << "Yes\n";

    }

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.8027586329014822x):
#include<bits/stdc++.h>

using namespace std;

string s;

int a[50];

int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(0);

    cout.tie(0);

    cin>>s;

    int i,j,c=1,d;

    for(i=0; i<s.length(); i++)

    {

        if(s[i]>='a'&&s[i]<='z')

        {

            a[s[i]-'a']++;

        }



    }

    for(i=0; i<26; i++)

    {

        if(a[i]%2!=0)

        {

            c=0;

            break;

        }

    }

    if(c==0)

    {

        cout<<"No\n";

    }

    else

        cout<<"Yes\n";









    return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.8115041226284863x):
#include <bits/stdc++.h>



using namespace std;



#define endl '\n'

#define Opy ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)



typedef long long ll;



int main()

{

    map< char, int > A;

    A.clear();



    char B[110];



    cin>> B;



    for(int i = 0; i < strlen(B); i++)

    {

        A[B[i]]++;

    }



    int flag = 0;



    auto it = A.begin();



    while(it != A.end())

    {

        if(it->second % 2 != 0)

        {

            flag = 1;

            break;

        }

        it++;

    }



    if(flag == 0) cout<< "Yes\n";



    else cout<< "No\n";



	return 0;

}
// Slower C++ solution:
/*Bismillahir Rahmanir Rahim

->>Code by Ashraful Islam Paran

->>CUET,CSE

*/

#include <bits/stdc++.h>

using namespace std;

typedef int64_t ll;

typedef unsigned long long ull;

typedef vector<int> vi;

const int MX=2e5+5;

#define f(i,x,n) for(int i=x;i<n;i++)

#define pb push_back

#define endl "\n"

#define yes cout<<"Yes"<<endl

#define no cout<<"No"<<endl



int main()

{

    ios_base::sync_with_stdio(false);

    cin.tie(NULL);

    cout.tie(NULL);



    string s;

    int a[MX]={0},p{0};

    cin>>s;

    f(i,0,s.size())

    {

        a[s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(a[i]%2)

        {

            p=1;

        }

    }

    if(p)

    {

        no;

    }

    else

        yes;



    return 0;

}




// Faster C++ solution for the same problem (measured speedup: 1.8060652924896328x):
#include<bits/stdc++.h>

using namespace std;



int main(){

     string s;

cin>>s;

        map<char, int> m;

        for(char x: s){

            m[x]++;

        }

        for(auto x: m) if(x.second%2!=0) {cout<<"No"<<endl; return 0;}

        cout<<"Yes"<<endl;



}
// Slower C++ solution:


#include<bits/stdc++.h>

#define lln long long int

#define llu unsigned lln

#define sc(n) scanf("%d",&n);

#define scl(n) scanf("%lld",&n);

#define scd(n) scanf("%lf",&n);

#define pf(res) printf("%d\n",res);

#define pfl(res) printf("%lld\n",res);

#define pfd(res) printf("%lf\n",res);

#define maxii 100005

using namespace std;

typedef pair<int,int> pii;

typedef pair<lln,lln> pll;

 vector<int> vi[maxii];

 vector<int>:: iterator child;

typedef vector<lln> vl;

typedef vector<pii> vii;

typedef vector<pll> vll;





int arr[maxii];

int arr2[maxii];

bool check[maxii];



bool dfs(int node,int c)

{

    check[node]=true;

    arr2[node]=c;

    for(int child=0;child<vi[node].size();child++)

    {

        if(check[vi[node][child]]==false)

        {

            if(dfs(vi[node][child],c^1)==false)

            {

                return false;

            }

        }

        else if(arr2[node]==arr2[vi[node][child]])

        {

            return false;

        }

        //else if()

    }

    return true;

}



int main()

{

   string a;

   cin>>a;

   int len=a.size();

   for(int i=0;i<len;i++)

   {

       arr[a[i]-'a']++;

   }

   int c=0;

   for(int i=0;i<26;i++)

   {

       if(arr[i]%2!=0)

       {

           c=1;

           break;

       }

   }

   if(c==0)

   {

       printf("Yes\n");

   }

   else cout<<"No";

}










// Faster C++ solution for the same problem (measured speedup: 3.525076304555864x):
/// @author MUSTAFA MOGHAZY

#include<bits/stdc++.h>

using namespace std;

#define ll long long

int a [32+4];

int main()

{

 string s; cin>>s;

 for(int i=0; i<s.size(); ++i){

    ++a[ s[i] - 96];

 }

 for(int i=1; i<=32; ++i){

    if(a[i]%2==1){

        cout<<"No\n";

        return 0;

    }

 }

 cout<<"Yes\n";

}
// Slower C++ solution:
#include<iostream>

#include<algorithm>

#include<cstdio>

#include<cstring>

#include<stdlib.h>

using namespace std;

const int N=1e4+50;

const int INF=0x3f3f3f;

char s[N];

int vis[N];

int main()

{

    scanf("%s",s);

    int len=strlen(s);

    for(int i=0;i<len;i++)

    {

        vis[(int)s[i]]++;

    }

    for(int i=97;i<=122;i++)

    {

        if(vis[i]%2!=0)

        {

            printf("No\n");

            return 0;

        }

    }

    printf("Yes\n");

    return 0;

}

// Faster C++ solution for the same problem (measured speedup: 5.267467619815462x):
#include<stdio.h>

int main()

{

    char str[10000];

    int i,j,count=0,f,x,a[26]={0},c=0;

    scanf("%s",str);

    for(i=0;str[i]!='\0';i++)

    {

        if(str[i]>='a'&&str[i]<='z')

        {

            x=str[i]-'a';

            a[x]++;

        }

    }

    for(i=0;i<26;i++)

    {

        if(a[i]%2==0)

        {

            c++;

        }

    }

    if(c==26)

    {

        printf("Yes\n");

    }

    else

    {

        printf("No\n");

    }

    return 0;

}