#include using namespace std; #include using namespace atcoder; using ll = long long; int n; string s,t; void solve(){ int ans = n; int cur = 0; for(int i = n-1;i>=0;i--){ if(s[i]!=t[i]){ cur++; } } if(cur%2==0){ ans = cur; } reverse(s.begin(),s.end()); cur = 0; for(int i = n-1;i>=0;i--){ if(s[i]!=t[i]){ cur++; } } if(cur%2==1){ ans = min(ans,cur); } cout<> n >> s >> t; solve(); }