// May this submission get accepted
#pragma GCC optimize ("O3")

#include <bits/stdc++.h>

// 汎用マクロ
#define ALL_OF(x) (x).begin(), (x).end()
#define REP(i,n) for (long long i=0, i##_len=(n); i<i##_len; i++)
#define RANGE(i,is,ie) for (long long i=(is), i##_end=(ie); i<=i##_end; i++)
#define DSRNG(i,is,ie) for (long long i=(is), i##_end=(ie); i>=i##_end; i--)
#define STEP(i, is, ie, step) for (long long i=(is), i##_end=(ie), i##_step = (step); i<=i##_end; i+=i##_step)
#define UNIQUE(v) do { sort((v).begin(), (v).end()); (v).erase(unique((v).begin(), (v).end()), (v).end()); } while (false)
template<class T> bool chmax(T &a, const T &b) { if (a < b) {a = b; return true;} return false; }
template<class T> bool chmin(T &a, const T &b) { if (a > b) {a = b; return true;} return false; }
#define INF 0x7FFFFFFF
#define LINF 0x7FFFFFFFFFFFFFFFLL
#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")
#define DUMP(q) cerr << "[DEBUG] " #q ": " << (q) << " at " __FILE__ ":" << __LINE__ << endl
#define DUMPALL(q) do { cerr << "[DEBUG] " #q ": ["; REP(DUMPALL_ITR, (q).size()) { cerr << (q)[DUMPALL_ITR] << (DUMPALL_ITR == DUMPALL_ITR_len-1 ? "" : ", "); } cerr << "] at " __FILE__ ":" << __LINE__ << endl; } while (false)
template<class T> T gcd(T a, T b) { if (a < b) std::swap(a, b); while (b) std::swap(a %= b, b); return a; }
template<class T> T lcm(const T a, const T b) { return a / gcd(a, b) * b; }

// gcc拡張マクロ
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll

// エイリアス
#define DANCE_ long
#define ROBOT_ unsigned
#define HUMAN_ signed
using  ll = DANCE_ HUMAN_ DANCE_;
using ull = DANCE_ ROBOT_ DANCE_;
using  ld = long double;
using namespace std;

// 標準入出力
struct inp {
    size_t sz;
    inp(size_t _sz = 1) : sz(_sz) {}
    template <typename T> operator T () const { T a; cin >> a; return a; }
    template <typename T> operator vector<T> () const { vector<T> a(sz); for (size_t i = 0; i < sz; i++) cin >> a[i]; return a; }
    template <typename T, typename U> operator pair<T, U> () const { T f; U s; cin >> f >> s; return pair<T, U>(f, s); }
};
inp inp1; // input one
template <typename T> void say(T &x, char end = '\n') { cout << x << end; }
template <typename T> void say(vector<T> &x, char sep = ' ', char end = '\n') { for (size_t i = 0, sz = x.size(); i < sz; i++) { cout << x[i] << (i == sz-1 ? end : sep); } }

// モジュール

// 剰余演算
constexpr ll pdiv = 1000000007LL; // 10^9+7
ll powll(ll a, ll n) {
    ll result = 1;
    ll base = a;
    ll mask = 1;
    while (mask <= n) {
        if (n & mask) (result *= base) %= pdiv;
        mask <<= 1;
        (base *= base) %= pdiv;
    }
    return result;
}

inline ll invll(ll a) { return powll(a, pdiv-2); }

vector<ll> fac_cache = {1}, invfac_cache = {1};
void make_fac_cache(ll a) {
    ll old_max = fac_cache.size() - 1;
    if (a > old_max) {
        fac_cache   .resize(a+1);
        invfac_cache.resize(a+1);
        for (ll i = old_max + 1; i <= a; i++) {
            fac_cache[i] = fac_cache[i-1] * i % pdiv;
        }
        invfac_cache[a] = invll(fac_cache[a]);
        for (ll i = a-1; i > old_max; i--) {
            invfac_cache[i] = invfac_cache[i+1] * (i + 1) % pdiv;
        }
    }
}

inline ll    facll(ll a) { make_fac_cache(a); return fac_cache[a]; }
inline ll invfacll(ll a) { make_fac_cache(a); return invfac_cache[a]; }
inline bool isoutll(ll n, ll r) { return n < 0 || r < 0 || n < r; }
inline ll nPr(ll n, ll r) { return isoutll(n, r) ? 0 : facll(n) * invfacll(n-r) % pdiv; }
inline ll nCr(ll n, ll r) { return isoutll(n, r) ? 0 : facll(n) * invfacll(n-r) % pdiv * invfacll(r) % pdiv; }
inline ll nHr(ll n, ll r) { return nCr(n+r-1, r); }

// 処理内容
int main() {
    
    ios::sync_with_stdio(false); // stdioを使うときはコメントアウトすること
    cin.tie(nullptr);            // インタラクティブ問題ではコメントアウトすること
    
    ll n = inp1;
    vector<ll> x = inp(n);

    vector<ll> d(n-1);
    REP(i, n-1) d[i] = x[i+1] - x[i];

    // if (n > 2000) return 1;

    ll ans = 0;
    ll dpback = 0;
    REP(j, n-1) {
        // 全ての順列(0-indexed)に対し
        // iを以右についてmaxを更新する項の数
        
        ll m = j+1;
        // vector<ll> dp(m, 0);
        // make_fac_cache(m);
        // REP(i, m) {
        //     dp[i] = facll(m) * invll(m-i) % pdiv;
        // }
        // REP(i, m-1) {
        //     (dp[i+1] += dp[i]) %= pdiv;
        // }
        dpback = ((j+1) * dpback % pdiv + facll(j)) % pdiv;
        // DUMPALL(dp);
        // DUMP(dp.back());
        // DUMP(dpback);

        ll term = dpback % pdiv;
        (term *= nPr(n-1, n-1-m)) %= pdiv;
        (term *= d[j]) %= pdiv;
        // DUMP(term);

        (ans += term) %= pdiv;
    }
    say(ans);

    // ll ans = 0;
    // REP(i, n-1) {
    //     ll term = (i+1) * invll(n-1-i) % pdiv;
    //     (term *= d[i]) %= pdiv;
    //     (ans += term) %= pdiv;
    // }

    // (ans *= facll(n-1)) %= pdiv;

    // say(ans);
    
}

Measured memory_bytes: 3456