#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")

////////////////////////////////////////////////////////////////////////////////
template <unsigned M_> struct ModInt {
  static constexpr unsigned M = M_;
  unsigned x;
  constexpr ModInt() : x(0U) {}
  constexpr ModInt(unsigned x_) : x(x_ % M) {}
  constexpr ModInt(unsigned long long x_) : x(x_ % M) {}
  constexpr ModInt(int x_) : x(((x_ %= static_cast<int>(M)) < 0) ? (x_ + static_cast<int>(M)) : x_) {}
  constexpr ModInt(long long x_) : x(((x_ %= static_cast<long long>(M)) < 0) ? (x_ + static_cast<long long>(M)) : x_) {}
  ModInt &operator+=(const ModInt &a) { x = ((x += a.x) >= M) ? (x - M) : x; return *this; }
  ModInt &operator-=(const ModInt &a) { x = ((x -= a.x) >= M) ? (x + M) : x; return *this; }
  ModInt &operator*=(const ModInt &a) { x = (static_cast<unsigned long long>(x) * a.x) % M; return *this; }
  ModInt &operator/=(const ModInt &a) { return (*this *= a.inv()); }
  ModInt pow(long long e) const {
    if (e < 0) return inv().pow(-e);
    ModInt a = *this, b = 1U; for (; e; e >>= 1) { if (e & 1) b *= a; a *= a; } return b;
  }
  ModInt inv() const {
    unsigned a = M, b = x; int y = 0, z = 1;
    for (; b; ) { const unsigned q = a / b; const unsigned c = a - q * b; a = b; b = c; const int w = y - static_cast<int>(q) * z; y = z; z = w; }
    assert(a == 1U); return ModInt(y);
  }
  ModInt operator+() const { return *this; }
  ModInt operator-() const { ModInt a; a.x = x ? (M - x) : 0U; return a; }
  ModInt operator+(const ModInt &a) const { return (ModInt(*this) += a); }
  ModInt operator-(const ModInt &a) const { return (ModInt(*this) -= a); }
  ModInt operator*(const ModInt &a) const { return (ModInt(*this) *= a); }
  ModInt operator/(const ModInt &a) const { return (ModInt(*this) /= a); }
  template <class T> friend ModInt operator+(T a, const ModInt &b) { return (ModInt(a) += b); }
  template <class T> friend ModInt operator-(T a, const ModInt &b) { return (ModInt(a) -= b); }
  template <class T> friend ModInt operator*(T a, const ModInt &b) { return (ModInt(a) *= b); }
  template <class T> friend ModInt operator/(T a, const ModInt &b) { return (ModInt(a) /= b); }
  explicit operator bool() const { return x; }
  bool operator==(const ModInt &a) const { return (x == a.x); }
  bool operator!=(const ModInt &a) const { return (x != a.x); }
  friend std::ostream &operator<<(std::ostream &os, const ModInt &a) { return os << a.x; }
};
////////////////////////////////////////////////////////////////////////////////

constexpr unsigned MO = 1'000'000'009;
using Mint = ModInt<MO>;


constexpr int K = 10;
int trans[1 << K][K];

int N;
char L[5010], R[5010];

Mint dp[5010][2][1 << K];

int main() {
  for (int p = 0; p < 1 << K; ++p) {
    for (int e = 0; e < K; ++e) {
      int &q = trans[p][e] = p;
      for (int k = e; k >= 0; --k) {
        if (q & 1 << k) {
          q &= ~(1 << k);
          break;
        }
      }
      q |= 1 << e;
    }
    trans[p][0] = p;
  }
  
  for (; ~scanf("%d", &N); ) {
    scanf("%s%s", L, R);
    Mint hard = 0, easy = 0;
    for (int phase = 0; phase < 2; ++phase) {
      memset(dp, 0, sizeof(dp));
      dp[0][0][0] = 1;
      for (int i = 0; i < N; ++i) {
        const int r = ((phase == 0) ? L[i] : R[i]) - '0';
        for (int s = 0; s < 2; ++s) for (int p = 0; p < 1 << K; ++p) if (dp[i][s][p]) {
          for (int e = 0; e < K; ++e) if (s || e <= r) {
            dp[i + 1][(s || e < r) ? 1 : 0][trans[p][e]] += dp[i][s][p];
          }
        }
      }
      for (int s = 0; s < 2; ++s) for (int p = 0; p < 1 << K; ++p) {
        if (phase == 0 && s == 0) continue;
        hard += (phase?+1:-1) * dp[N][s][p] * __builtin_popcount(p);
      }
      memset(dp, 0, sizeof(dp));
      dp[0][0][0] = 1;
      for (int i = 0; i < N; ++i) {
        const int r = ((phase == 0) ? L[i] : R[i]) - '0';
        for (int s = 0; s < 2; ++s) for (int p = 0; p < K; ++p) if (dp[i][s][p]) {
          for (int e = 0; e < K; ++e) if (s || e <= r) {
            dp[i + 1][(s || e < r) ? 1 : 0][i ? p : e] += dp[i][s][p];
          }
        }
      }
      for (int s = 0; s < 2; ++s) for (int p = 0; p < K; ++p) {
        if (phase == 0 && s == 0) continue;
        easy += (phase?+1:-1) * dp[N][s][p] * p;
      }
    }
cerr<<"hard = "<<hard<<", easy = "<<easy<<endl;
    const Mint ans = 10 * hard - easy;
    printf("%u\n", ans.x);
  }
  return 0;
}