//# pragma GCC optimize("Ofast,no-stack-protector")
//# pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
# pragma GCC optimize("Ofast")
# pragma GCC optimization ("unroll-loops")
# include "bits/stdc++.h"
std::pair<int,int> DR[] = {{-1,0},{0,1},{1,0},{0,-1},{-1,1},{-1,-1},{1,1},{1,-1}};
# define ll long long
# define clock (clock() * 1000.0 / CLOCKS_PER_SEC)
# define rc(s) return cout << s,0
# define rcg(s) cout << s;exit(0)
# define _ ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
# define db(x) cerr << #x << " = " << x << '\n'
# define pb push_back
# define mp make_pair
# define all(s) s.begin(),s.end()
# define sz(x) (int)((x).size())
//# define int ll
using namespace std;
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# define LOCAL
# define sim template < class c
# define ris return * this
# define dor > debug & operator <<
# define eni(x) sim > typename \
enable_if<sizeof dud<c>(0) x 1, debug&>::type operator<<(c i) {
sim > struct rge { c b, e; };
sim > rge<c> range(c i, c j) { return rge<c>{i, j}; }
sim > auto dud(c* x) -> decltype(cerr << *x, 0);
sim > char dud(...);
struct debug {
#ifdef LOCAL
~debug() { cerr << endl; }
eni(!=) cerr << boolalpha << i; ris; }
eni(==) ris << range(begin(i), end(i)); }
sim, class b dor(pair < b, c > d) {
ris << "(" << d.first << ", " << d.second << ")";
}
sim dor(rge<c> d) {
*this << "[";
for (auto it = d.b; it != d.e; ++it)
*this << ", " + 2 * (it == d.b) << *it;
ris << "]";
}
#else
sim dor(const c&) { ris; }
#endif
};
#define show(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
int gcd(int a, int b)
{
if(b) return gcd(b,a%b);
return a;
}mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
// ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
int dp[1 << 20][3][2],ans = 1e9,n;
int32_t main(){_
//freopen("input","r",stdin);
cin >> n;
string sa,sb;
cin >> sa >> sb;
for(int i = 0;i <= n;i++)
{
for(int a = 0;a < 3;a++)
{
for(int b = 0;b < 2;b++)
{
dp[i][a][b] = 1e9;
}
}
}
dp[0][0][0] = 0;
for(int i = 1;i <= n;i++)
{
for(int a = 0;a < 3;a++)
{
for(int b = 0;b < 2;b++)
{
int col = sa[i - 1] - '0';
if(a > 0) col = a - 1;
if(b) col = !col;
if(col == sb[i - 1] - '0')
{
for(int aa = 0;aa < 3;aa++)
{
for(int bb = 0;bb < 2;bb++) dp[i][a][b] = min(dp[i][a][b],dp[i - 1][aa][bb] + (a != aa && a != 0) + (bb == 0 && b == 1));
}
}
//debug() << show(a) show(b) show(col) show(dp[i][a][b]);
if(i == n) ans = min(ans,dp[i][a][b]);
}
}
}
rc(ans);
return 0;
}
