#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstdint>
#include <cstring>
#include <ctime>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <unordered_map>
#include <unordered_set>

void solve() {
  int n;

  std::cin >> n;
  std::string s, t;
  std::cin >> s >> t;

  auto C = s;
  std::reverse(C.begin(), C.end());
  int ans1 = 0;
  int ans2 = 0;
  int c = 0, d = 0;

  // situation one
  int a = 0, b = 0;
  for (int i = 0; i < n; i++) {
    if (s[i] == '0' and t[i] == '1') {
      a += 1;
    } else if (s[i] == '1' and t[i] == '0') {
      b += 1;
    }
  }
  for (int i = 0; i < n; i++) {
    if (C[i] == '0' and t[i] == '1') {
      c += 1;
    } else if (C[i] == '1' and t[i] == '0') {
      d += 1;
    }
  }
  std::cout << std::min(a + b, c + d) << '\n';
}

int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(nullptr);

  int t = 1;
  // std::cin >> t;

  while (t--) solve();
  return 0;
}