// 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.7494871574478346x):
//                                 Alisher_2211

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        # include <bits/stdc++.h>

# define  long          long long

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

# define  allr(vc)      vc.rbegin(),vc.rend()

# define  pb            push_back

# define  fi            first 

# define  se            second

# define  pi            pair <long, long>    

# define  lcm(a, b)     (a * b) / __gcd(a, b)

                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                        using namespace std;

const long N = 100100;

void read(){freopen("input.txt" , "r" , stdin );freopen("output.txt", "w" , stdout );}



void solve(){

    string w;

    cin >> w;

    map<char, long> mp;

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

        mp[ w[i] ] ++;

    }

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

        if( mp[ w[i] ] % 2 ){

            cout << "No";

            return;

        }

    }

    cout << "Yes";

}

int32_t main(){

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

        long T = 1;

        //cin >> T;

        while( T-- ){

            solve();

            cout<<'\n';

        }

cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";

}