int findConnectedComponents(vector<long> d) {
    int n = d.size();
    long long ans = 0;
    for(int i=0;i<(1<<n);++i){
        vector<long long> v;
        vector<vector<int> > a(64);
        for(long long j=0;j<n;++j){
            long long bb = pow(2, j);
            if((1<<j)&i){
                v.push_back(d[j]);
            }
        }
        
        int par[64];
        for(int j=0;j<64;++j)par[j]=0; 
        int cnt = 0;
        set<long long> vv;
        
        for(int j=0;j<v.size();++j){
            while(1){
                int flag = 0;
                for(auto xx: vv){
                    if(xx&v[j]){
                        v[j]=(v[j]|xx);
                        vv.erase(xx);
                        flag=1;
                        break;
                    }
                }
                if(flag) continue;
                if(flag==0)break;
            }
            vv.insert(v[j]);
        }
        cnt = 0;
        int pp = 1;
        for(auto xx: vv){
            for(int j=0;j<64;++j){
                long long dd = pow(2, j);
                if(xx&dd){par[j]=pp; cnt = max(cnt,pp);}
            }
            pp++;   
        }
        for(int j=0;j<64;++j)if(par[j]==0)par[j]=pp++, cnt = max(cnt, par[j]);
        vv.clear();
        ans = ans + cnt;
        v.clear();
        a.clear();
        
    }
    return ans;
}

def formatbin(s): return '{:b}'.format(s)

def findConnectedComponents(d):
    # Write your code here
    
    # generate power set
    i = 1 << len(d)
    count = 0
    for s in range(i):
        # get current subset of powerset using bits of s to indicate if
        # ith element of d is in the subset
        ss = [n for ind,n in enumerate(d) if (1<<ind) & s != 0]
        #print(s, 'ss', ss)
        
        verts = 0
        connectedcount = 0
        for e in ss:
            # skip if power of 2 or zero, won't contribute to connections
            if (formatbin(e).count('1') - 1 if e else 0) < 1:
                continue
            # check if new connected component has been found
            if not verts & e:
                #print('new connected component', formatbin(verts), formatbin(e))
                connectedcount += 1
            # update running vertices with connections
            verts |= e
        # get vertex count that contribute to connections
        vertcount = formatbin(verts).count('1')
        
        #print('verts', formatbin(verts), 'connectedcount', connectedcount, 'vertcount', vertcount)
        
        # update count
        sscount = 64 - vertcount + connectedcount
        count += sscount
        
        #print(sscount)
    
    return count