#include <bits/stdc++.h>
using namespace std ;
#define LL long long int
#define ft first
#define sd second
#define PII pair<int,int>
#define MAXN 100005
#define MAXM 10000001
#define mp make_pair
#define f_in(st) freopen(st,"r",stdin)
#define f_out(st) freopen(st,"w",stdout)
#define sc(x) scanf("%d",&x)
#define scll(x) scanf("%lld",&x)
#define pr(x) printf("%d\n",x)
#define pb push_back
#define MOD 1000000007
#define MAX 1000010
#define ull long long
#define prime 37
#define pb push_back
#define ASST(x,y,z) assert(x >= y && x <= z)
#define inf 11111111

int t , n , total ;
string a , b ;

int start_from_a(){
    int i = 0 , ans_a = 0 ;
    bool f = 0 ;
    // f = 0 denotes string a
    // f = 1 denotes string b
    if( a[0] == '#' )
        return inf ;
    f = 0 ;
    while(i < n){
        if(!f){
            while(i < n && a[i] == '.') i ++ ;
            if(i < n){ ans_a ++ ; f = f ^ 1 ;}
        }else{
            while(i < n && b[i] == '.') i ++ ;
            if(i < n){ ans_a ++ ; f = f ^ 1 ;}
        }
    }
    return ans_a ;
}

int start_from_b(){
    int i = 0 , ans_b = 0 ;
    bool f = 0 ;
    // f = 0 denotes string a
    // f = 1 denotes string b
    if( b[0] == '#' )
        return inf ;
    f = 0 ;
    while(i < n){
        if(!f){
            while(i < n && b[i] == '.') i ++ ;
            if(i < n){ ans_b ++ ; f = f ^ 1 ;}
        }else{
            while(i < n && a[i] == '.') i ++ ;
            if(i < n){ ans_b ++ ; f = f ^ 1 ;}
        }
    }
    return ans_b ;
}

int solve(){
    int ans_a = start_from_a() ;
    int ans_b = start_from_b() ;
    return min(ans_a,ans_b) ;
}
int main(){
//    f_in("in11.txt") ;
//    f_out("out11.txt") ;
    sc(t) ;
    ASST(t,1,100000) ;
    while( t-- ){
        cin >> a ;
        cin >> b ;
        assert(a.length() == b.length()) ;
        n = a.length() ;
        total += n ;
        ASST(n,1,200000) ;
        for(int i=0;i<n;i++){
            assert(a[i] == '.' || a[i] == '#') ;
            assert(b[i] == '.' || b[i] == '#') ;
        }
        bool ok = true ;
        for(int i=0;i<n;i++){
            if(a[i] == '#' && b[i] == '#'){
                ok = false ;
            }
        }
        if(ok){
            cout << "Yes" << endl ;
            cout << solve() << endl ;
        }else{
            cout << "No" << endl ;
        }
    }
    assert( total <= 1000000 && total >= 1 ) ;
    return 0 ;
}