// Slower C++ solution:
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using VI = vector<int>;

using VL = vector<ll>;

#define FOR(i,a,n) for(int (i)=(a);(i)<(n);(i)++)

#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);(i)++)

#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);(i)--)

#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);(i)--)

#define SORT(i) sort((i).begin(),(i).end())

#define rSORT(i,a) sort((i).begin(),(i).end(),(a))

#define all(i) (i).begin(),(i).end()

constexpr ll INF = 1000000000;

constexpr ll LLINF = 1LL << 60;

constexpr ll mod = 1000000007;

constexpr ll MOD = 998244353;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }

template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }

inline void init() { cin.tie(nullptr); cout.tie(nullptr); cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }

template<class T>inline istream& operator>>(istream& input, vector<T>& v) { for (auto& elemnt : v)input >> elemnt; return input; }



template<int mod> struct ModInt {

    int x;



    ModInt() : x(0) {}

    ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}



    ModInt& operator+=(const ModInt& p) {

        if ((x += p.x) >= mod) x -= mod;

        return *this;

    }

    ModInt& operator-=(const ModInt& p) {

        if ((x += mod - p.x) >= mod) x -= mod;

        return *this;

    }

    ModInt& operator*=(const ModInt& p) {

        x = (int)(1LL * x * p.x % mod);

        return *this;

    }

    ModInt& operator/=(const ModInt& p) {

        *this *= p.inverse();

        return *this;

    }



    ModInt operator-() const { return ModInt(-x); }

    ModInt operator+(const ModInt& p) const { return ModInt(*this) += p; }

    ModInt operator-(const ModInt& p) const { return ModInt(*this) -= p; }

    ModInt operator*(const ModInt& p) const { return ModInt(*this) *= p; }

    ModInt operator/(const ModInt& p) const { return ModInt(*this) /= p; }



    bool operator==(const ModInt& p) const { return x == p.x; }

    bool operator!=(const ModInt& p) const { return x != p.x; }



    ModInt inverse() const {

        int a = x, b = mod, u = 1, v = 0, t;

        while (b > 0) {

            t = a / b;

            a -= t * b;

            swap(a, b);

            u -= t * v;

            swap(u, v);

        }

        return ModInt(u);

    }



    ModInt pow(int e) {

        long long a = 1, p = x;

        while (e > 0) {

            if (e % 2 == 0) { p = (p * p) % mod; e /= 2; }

            else { a = (a * p) % mod; e--; }

        }

        return ModInt(a);

    }



    friend ostream& operator<<(ostream& os, const ModInt<mod>& p) {

        return os << p.x;

    }

    friend istream& operator>>(istream& is, ModInt<mod>& a) {

        long long x;

        is >> x;

        a = ModInt<mod>(x);

        return (is);

    }

};

using modint = ModInt<mod>;



int main() {

    init();



    int n; cin >> n;

    VI c;

    FOR(i, 0, n) {

        int in;

        cin >> in;

        in--;

        if (c.empty() || c.back() != in)c.push_back(in);

    }

    n = c.size();



    vector<VI> num(200000);

    FOR(i, 0, n)num[c[i]].push_back(i);



    vector<modint> dp(n + 1);

    dp[0] = 1;

    FOR(i, 0, n) {

        dp[i + 1] += dp[i];

        auto itr = lower_bound(all(num[c[i]]), i);

        if (itr == num[c[i]].begin())continue;

        dp[i + 1] += dp[*--itr + 1];

    }

    cout << dp[n] << "\n";

}

// Faster C++ solution for the same problem (measured speedup: 2.4882777632913715x):
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

using ld = long double;

using VI = vector<int>;

using VL = vector<ll>;

template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;

#define FOR(i,a,n) for(int (i)=(a);(i)<(n);++(i))

#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);++(i))

#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);--(i))

#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);--(i))

#define each(i, a) for(auto &i : a)

#define SORT(i) sort((i).begin(),(i).end())

#define rSORT(i,a) sort((i).begin(),(i).end(),(a))

#define all(i) (i).begin(),(i).end()

#define out(y,x) ((y) < 0 || h <= (y) || (x) < 0 || w <= (x))

#define line cout << "------------------------\n" 

#define ENDL(i,n) ((i) == (n) - 1 ? "\n" : " ")

#define stop system("pause") //comment out this on AOJ.

constexpr ll INF = 1000000000;

constexpr ll LLINF = 1LL << 60;

constexpr ll mod = 1000000007;

constexpr ll MOD = 998244353;

constexpr ld eps = 1e-10; //1e-9?

constexpr ld pi = 3.1415926535897932;

template<class T>inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; }return false; }

template<class T>inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; }return false; }

inline void init() { cin.tie(nullptr); cout.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }

template<class T>inline istream& operator>>(istream& is, vector<T>& v) { for (auto& elemnt : v)is >> elemnt; return is; }

template<class T, class U>inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; }

template<class T>inline vector<T> vec(size_t a) { return vector<T>(a); }

template<class T>inline vector<T> defvec(T def, size_t a) { return vector<T>(a, def); }

template<class T, class... Ts>inline auto vec(size_t a, Ts... ts) { return vector<decltype(vec<T>(ts...))>(a, vec<T>(ts...)); }

template<class T, class... Ts>inline auto defvec(T def, size_t a, Ts... ts) { return vector<decltype(defvec<T>(def, ts...))>(a, defvec<T>(def, ts...)); }



int main() {

    init();



    int n; cin >> n;

    VI c;

    FOR(i, 0, n) {

        int x; cin >> x;

        if (!c.empty() && c.back() == x)continue;

        c.push_back(x);

    }

    n = c.size();



    VL cnt(200001), dp(n + 1);

    dp[0] = 1;



    FOR(i, 0, n) {

        (dp[i + 1] += dp[i]) %= mod;

        (dp[i + 1] += cnt[c[i]]) %= mod;

        (cnt[c[i]] += dp[i]) %= mod;

    }



    cout << dp[n] << "\n";

}