#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vb=vector<bool>;
using vvb=vector<vb>;
using vd=vector<double>;
using vvd=vector<vd>;
using vi=vector<int>;
using vvi=vector<vi>;
using vl=vector<ll>;
using vvl=vector<vl>;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll>;
using tlll=tuple<ll,ll,ll>;
using vs=vector<string>;
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define rep(i,n) range(i,0,n)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define range(i,a,n) for(ll i=(a);i<(n);i++)
#define LINF ((ll)1ll<<60)
#define INF ((int)1<<30)
#define EPS (1e-9)
#define MOD (1000000007ll)
#define fcout(a) cout<<setprecision(a)<<fixed
#define fs first
#define sc second
#define PI (3.1415926535897932384)

int dx[]={1,0,-1,0,1,-1,-1,1},dy[]={0,1,0,-1,1,1,-1,-1};
template<class T>bool chmax(T&a,T b){if(a<b){a=b; return true;}return false;}
template<class T>bool chmin(T&a,T b){if(a>b){a=b; return true;}return false;}
template<class S>S sum(vector<S>&a){return accumulate(all(a),S());}
template<class S>S max(vector<S>&a){return *max_element(all(a));}
template<class S>S min(vector<S>&a){return *min_element(all(a));}
ll max(int a,ll b){return max((ll)a,b);} ll max(ll a,int b){return max(a,(ll)b);}
int sgn(const double&r){return (r>EPS)-(r<-EPS);} // a>0  : sgn(a)>0
int sgn(const double&a,const double&b){return sgn(a-b);} // b<=c : sgn(b,c)<=0

template<class T>void puta(T&&t){cout<<t<<"\n";}
template<class H,class...T>void puta(H&&h,T&&...t){cout<<h<<' ';puta(t...);}
template<class S,class T>void tf(bool b,S t,T f){if(b)puta(t);else puta(f);}
void YN(bool b){tf(b,"YES","NO");}
void Yn(bool b){tf(b,"Yes","No");}
void yn(bool b){tf(b,"yes","no");}
template<class S,class T>ostream&operator<<(ostream&os,pair<S,T>p){os<<"["<<p.first<<", "<<p.second<<"]";return os;};
template<class S>auto&operator<<(ostream&os,vector<S>t){bool a=1;for(auto s:t){os<<(a?"":" ")<<s;a=0;}return os;}
template<class S>auto&operator>>(istream&is,vector<S>&t){for(S&a:t)cin>>a;return is;}

long long modinv(long long a, long long m) {
    long long b = m, u = 1, v = 0;
    while (b) {
        long long t = a / b;
        a -= t * b; swap(a, b);
        u -= t * v; swap(u, v);
    }
    u %= m;
    if (u < 0) u += m;
    return u;
}

//niwango-B

int main(void){
  	cin.tie(0);
  	ios::sync_with_stdio(false);
  	
    ll n,ans=0;
    cin>>n;
    /*
    if(n>=2001){
        puta("無理っす");
        return 0;
    }
    */
    vl cost(n-1);
    ll posi,reposi;
    cin>>reposi;
    for(ll i=0;i<n-1;i++){//costを格納
        cin>>posi;
        cost[i]=posi-reposi;
        reposi=posi;
    }
    
    vl mul(n-1,1);
    /*
    for(int i=1;i<n-1;i++){
        for(int j=0;j<n-1;j++){
            if(j!=i){
                mul[j]=(mul[j]*(i+1))%MOD;
            }else if(j==i){
                mul[j]=(mul[j]+mul[j-1])%MOD;
            }
        }
    }
    */
    ll left=1;
    for(ll i=1;i<n;i++){
        left=(left*i)%MOD;
    }
    mul[0]=left;
    for(ll i=1;i<n-1;i++){
        mul[i]=(mul[i-1]+left*modinv(i+1,MOD))%MOD;
        //cout<<mul[i]<<" "<<mul[i-1]<<" "<<left/(i+1)<<endl;
    }
    /*
    rep(i,n-1){
        cout<<mul[i]<<" ";
    }cout<<endl;
    rep(i,n-1){
        cout<<mul[i]<<" ";
    }cout<<endl;
    */
    rep(i,n-1){
        ans=(ans+(cost[i]*mul[i])%MOD)%MOD;
    }
    
    cout<<ans<<endl;
}


Measured memory_bytes: 1792