//#define NDEBUG
#include <algorithm>
#include <cstddef>
#include <cstdint>
#include <iostream>
#include <vector>

namespace n91 {

  using i8 = std::int_fast8_t;
  using i32 = std::int_fast32_t;
  using i64 = std::int_fast64_t;
  using u8 = std::uint_fast8_t;
  using u32 = std::uint_fast32_t;
  using u64 = std::uint_fast64_t;
  using isize = std::ptrdiff_t;
  using usize = std::size_t;

  struct rep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { ++i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr rep(const usize f, const usize l) noexcept
      : f(std::min(f, l)), l(l) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  struct revrep {
    struct itr {
      usize i;
      constexpr itr(const usize i) noexcept : i(i) {}
      void operator++() noexcept { --i; }
      constexpr usize operator*() const noexcept { return i; }
      constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }
    };
    const itr f, l;
    constexpr revrep(const usize f, const usize l) noexcept
      : f(l - 1), l(std::min(f, l) - 1) {}
    constexpr auto begin() const noexcept { return f; }
    constexpr auto end() const noexcept { return l; }
  };
  template <class T> auto md_vec(const usize n, const T& value) {
    return std::vector<T>(n, value);
  }
  template <class... Args> auto md_vec(const usize n, Args... args) {
    return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));
  }
  template <class T> constexpr T difference(const T& a, const T& b) noexcept {
    return a < b ? b - a : a - b;
  }
  template <class T> void chmin(T& a, const T& b) noexcept {
    if (b < a)
      a = b;
  }
  template <class T> void chmax(T& a, const T& b) noexcept {
    if (a < b)
      a = b;
  }
  template <class T> T scan() {
    T ret;
    std::cin >> ret;
    return ret;
  }

} // namespace n91

#include <algorithm>
#include <iostream>
#include <limits>
#include <string>
#include <utility>

namespace n91 {

  void main_() {
    const usize n{ scan<usize>() };
    const std::string s{ scan<std::string>() };
    isize ans = 0;
    static constexpr isize Minf = std::numeric_limits<isize>::lowest();
    std::vector<isize> dp(n + 1, Minf), dp9 = dp, dp99 = dp, dp1 = dp;
    dp[0] = 0;
    for (const auto i : rep(0, n)) {
      chmax(dp[i + 1], dp[i]);
      chmax(dp9[i + 1], dp9[i]);
      chmax(dp99[i + 1], dp99[i]);
      chmax(dp1[i + 1], dp1[i]);
      const char e = s[i];
      if (e == '3' || e == '5' || e == '7') {
        ++ans;
        continue;
      }
      if (e == '1') {
        chmax(dp1[i + 1], dp[i]);
        chmax(dp[i + 1], dp99[i] + 1);
        chmax(dp[i + 1], dp1[i] + 1);
      }
      else {
        chmax(dp9[i + 1], dp[i]);
        chmax(dp99[i + 1], dp9[i]);
        chmax(dp[i + 1], dp1[i] + 1);
      }
    }
    std::cout << ans + dp[n] << std::endl;
  }

} // namespace n91

int main() {
  n91::main_();
  return 0;
}