20250313(π-1)

# def f(n):

# if n==1 or n==2:

# return 1

# return f(n-1)+f(n-2)

# n=int(input())

# print(f(n+1))

import math

def dfs(s,o):

global a,b,c,d,m,ans

if o==m:

if ans>s:

ans=s

return

l=b[o]

if abs(l-c)<abs(l-d):

s=s+(abs(l-c))

c=l

else:

s = s + (abs(l - d))

d = l

print(c,d)

dfs(s,o+1)

n=int(input())

ans=200000

a=[1 for i in range(n)]

b=[]

e=[0 for i in range(n)]

c,d=map(int,input().split())

a[d]=0

a[c]=0

m=int(input())

for i in range(m):

v = int(input())

b.append(v)

dfs(0,0)

print(ans)