#include<fstream>
#include<algorithm>
using namespace std;
ifstream fi("teststr.in");
ofstream fo("teststr.out");
int tru[10001]={0};
int ans=0;
int n,k;
int main(){
fi>>n>>k;
for(int i=1;i<=k;i++){
fi>>tru[i];
}
sort(tru+1,tru+1+k);
for(int i=2;i<=k;i++){
ans=max(tru[i]-tru[i-1],ans);
}
ans/=2;
ans=max(ans,tru[1]);
ans=max(ans,n-tru[k]);//details all r in cstdio's report of solution
fo<<ans<<endl;//hia hia
return 0;//cool
}