Problem:
 Score : 300 points    Problem Statement Snuke has decided to play with a six-sided die. Each of its six sides shows an integer 1 through 6 , and two numbers on opposite sides always add up to 7 .  Snuke will first put the die on the table with an arbitrary side facing upward, then repeatedly perform the following operation:   Operation: Rotate the die 90° toward one of the following directions: left, right, front (the die will come closer) and back (the die will go farther). Then, obtain y points where y is the number written in the side facing upward.   For example, let us consider the situation where the side showing 1 faces upward, the near side shows 5 and the right side shows 4 , as illustrated in the figure.
If the die is rotated toward the right as shown in the figure, the side showing 3 will face upward.
Besides, the side showing 4 will face upward if the die is rotated toward the left, the side showing 2 will face upward if the die is rotated toward the front, and the side showing 5 will face upward if the die is rotated toward the back.     Find the minimum number of operation Snuke needs to perform in order to score at least x points in total.      Constraints  1 ≦ x ≦ 10^{15}  x is an integer.         Input The input is given from Standard Input in the following format:  x       Output Print the answer.        Sample Input 1 7      Sample Output 1 2       Sample Input 2 149696127901      Sample Output 2 27217477801

Solution (Python):
n = int(input())
ans = 0
ans += (n // 11) * 2
if n % 11 == 0:
    print(ans)
elif n % 11 <= 6:
    print(ans + 1)
else:
    print(ans + 2)

Solution (Python):
x=int(input())
ans=0
ans+=(x//11)*2
if x%11==0:
    print(ans)
elif x%11<=6:
    print(ans+1)
else:
    print(ans+2)

Solution (Python):
x=int(input())
ans=0
ans+=(x//11)*2
if x%11==0:
    print(ans)
elif x%11<=6:
    print(ans+1)
else:
    print(ans+2)

Solution (Python):
import math

x = int(input())
tmp = math.ceil(x / 11)  
if 11 * tmp - x >= 5:
    
    ans = tmp * 2 - 1
else:
    ans = tmp * 2
print(ans)

Solution (Python):
import math
N = int(input())
ans = math.ceil(N / 11) * 2
if 1 <= N % 11 <= 6:
    ans -= 1
print(ans)

Solution (Python):
def main():
    """
    1 <= x <= 10**15

    どのパターンで得点が一番多いか
    (5) -> 6 -> 5 > 6 -> 5 ...
    """
    x = int(input())

    d1, r1 = divmod(x, 11)
    ans = d1 * 2 + (r1 // 6) + (r1 % 6 > 0)

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
N=input()
cnt=N/11*2
amari=N%11
if amari==0:
	pass
elif 0<amari and amari<=6:
	cnt+=1
else:
	cnt+=2
print cnt

Solution (Python):
X=int(input())
ans=X//11*2
if (X%11==0):
 print(ans)
elif (X%11<=6):
 print(ans+1)
else:
 print(ans+2)

Solution (Python):
def solve():
    N = int(input())

    ans = N // 11

    if (N - 11 * ans) == 0:
        print(ans * 2)
    elif (N - 11 * ans) > 6:
        print(ans * 2 + 2)
    elif 0 < (N - 11 * ans) <= 6:
        print(ans * 2 + 1)

solve()

Solution (Python):
x = int(input())

res = 0
res += (x//11)*2
if x%11 == 0:
  print(res)
elif x%11 <= 6:
  print(res+1)
else:
  print(res+2)

Solution (Python):
x = int(input())
print(x//11*2 if x%11==0 else x//11*2+1 if x%11<7 else x//11*2+2)

Solution (Python):
x = int(input())
if x < 7:
    print(1)
    exit()
elif x % 11 is 0:
    print((x // 11) * 2)
elif x % 11 < 7:
    print((x // 11) * 2 + 1)
else:
    print((x // 11) * 2 + 2)

Solution (Python):
X=int(input())
ans=X//11*2
if (X%11==0):
 print(ans)
elif (X%11<=6):
 print(ans+1)
else:
 print(ans+2)

Solution (Python):
def main():
    x = int(input())

    ans = x // 11 * 2
    if x%11 <= 6 and x%11 > 0:
        ans += 1
    elif x%11 > 6:
        ans += 2
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
x = int(input())

ans = (x // 11) * 2
if x % 11 <= 6 and x % 11 > 0:
    ans += 1
elif x % 11 > 6:
    ans += 2
print(ans)

Solution (Python):
from collections import defaultdict


def solve(x):
    if x % 11 == 0:
        return x // 11 * 2
    if x % 11 <= 6:
        return x // 11 * 2 + 1
    return x // 11 * 2 + 2


def main():
    x = int(input())
    print(solve(x))

if __name__ == '__main__':
    main()

Solution (Python):
from collections import defaultdict


def main():
    x = int(input())
    ans = (x // 11) * 2
    now = (x // 11) * 11
    a = 0
    while now < x:
        if a % 2 == 0:
            now += 6
        else:
            now += 5
        a += 1
        ans += 1
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
ans = 0
ans += (n // 11) * 2
n %= 11

if n == 0:
  ()
elif n <= 6:
  ans += 1
else:
  ans += 2

print(ans)

Solution (Python):
x = int(input())
cnt = int(x / 11)*2 

if x%11==0:
  print(cnt)
elif x%11<=6:
  print(cnt+1)
else:
  print(cnt+2)

Solution (Python):
x = input()
a = x/11
if x%11 == 0:
  print a*2
elif x%11 <= 6:
  print a*2+1
else:
  print a*2+2

Solution (Python):
import math
x = int(input())

if x <= 6:
    print(1)
elif x<= 11:
    print(2)
else:
    z = x%11
    if 1 <= z <= 6:
        print((math.ceil(x/11)*2)-1)
    elif z <= 10 or z== 0:
        print(math.ceil(x/11)*2)

Solution (Python):
x = int(input())

sho = x // 11
ama = x % 11

count = 2 * sho
if 0 < ama < 11 :
    if ama > 6:
        count += 2
    else:
        count += 1

print(count)

Solution (Python):

x = int(input())
cnt = 0
cnt += x // (6 + 5) * 2
x %= (6 + 5)
if x >= 1:
    cnt += 1
    x -= 6
    if x >= 1:
        cnt += 1
        x -= 5
assert - 5 <= x <= 0
print(cnt)

Solution (Python):
x = input()
if(x%11==0) :
    print x/11*2
elif(x%11<=6) :
    print x/11*2+1
else :
    print x/11*2+2

Solution (Python):
N=int(input())
m=int(N/11)
r=N%11
if r==0:
  print(2*m)
elif r<7:
  print(2*m+1)
else:
  print(2*m+2)

Solution (Python):
x = int(raw_input())
ans = (x / 11) * 2
d = x % 11
if d > 6:
    ans += 2
elif d > 0:
    ans += 1
print ans

Solution (Python):
x = int(input())
q = x // 11
m = x % 11
if(m == 0):
  print(q * 2)
elif(m < 7):
  print(q * 2 + 1)
else:
  print(q * 2 + 2)

Solution (Python):



x = input()
q = (x/11)
r = x-11*q
if(r==0):
    print(2*q)
elif(r<=6):
    print(2*q+1)
else:
    print(2*q+2)

Solution (Python):
x = int(raw_input())
a = (x/11) * 2
b = x % 11
if b > 6:
	a += 2
elif b > 0:
	a += 1
print a

Solution (Python):
if __name__ == "__main__":
    x = int(input())
    x -= 1
    n = x//11
    m = x%11
    ans = 2*(n+1) if m > 5 else 2*n+1
    print(ans)

Solution (Python):
x = int(input())

a = x//11
b = x - 11*a
c = 0
if b <=6 and b >0:
    c = 1
elif b>6:
    c = 2

print(2*a + c)

Solution (Python):
x = int(input())

a = x // 11

ans = 10 ** 15
for n in range(max(0, a - 100), a + 100):
    if 6 * n + 5 * n >= x:
        ans = min(ans, n + n)
    if 6 * n + 5 * (n - 1) >= x:
        ans = min(ans, n + n - 1)

print(ans)

Solution (Python):
n = int(input())
a = n//11
b = n%11
if b==0:
    c = 0
elif 0< b <= 6:
    c = 1
else:
    c = 2
print(a*2+c)

Solution (Python):
import sys

stdin = sys.stdin
def na(): return map(int, stdin.readline().split())
def ns(): return stdin.readline().strip()
def ni(): return int(stdin.readline())

x = ni()
t = x%11
if(t == 0): ans = -1
else: ans = 0
print(ans + x//11*2 + t//7+1)

Solution (Python):


x = int(input())




quot, rem = divmod(x, 11)
quot *= 2


if rem>6:
    quot += 2
elif rem>0:
    quot += 1

print(quot)

Solution (Python):
x = int(input())
if x % 11 == 0:
    print((x // 11)*2)
elif x % 11 <= 6:    
    print((x // 11)*2 + 1)
else:
    print((x // 11)*2 + 2)

Solution (Python):
x = int(input())
point = 0
count = int(x / 11)
amari = x % 11
if amari == 0:
    print(count*2)
elif amari<7:
    print(count*2+1)
else:
    print(count*2+2)

Solution (Python):
x = int(input())

mod = x % 11
ans = 0

if mod == 0:
    ans = 2 * int(x / 11)
elif mod <= 6:
    ans = 2 * int(x / 11) + 1
else:
    ans = 2 * int(x / 11) + 2

print(ans)

Solution (Python):
if __name__=="__main__":
    [s] = map(int, input().split())
    q = int(s / 11)
    r = s % 11
    if(r!=0):
        r = int((r-1)/6 + 1)
    print(2*q + r)

Solution (Python):


def main():
    x=int(input())
    answer=(x//11)*2
    x%=11
    print(answer if x==0 else(answer+1 if x<7 else answer+2))
    

if __name__=="__main__":
    main()

Solution (Python):
import sys
input_lines1 = sys.stdin.readlines()
for line in input_lines1:
    strBuf = line.replace('\n', '').split(' ')

    if int(strBuf[0]) <= 6 :
        print 1
    elif (int(strBuf[0])) <= 11:
        print 2
    elif (int(strBuf[0])) % 11 == 0:
        print (int(strBuf[0])) / 11 * 2

    elif (int(strBuf[0])) % 11 > 0:
        if (int(strBuf[0])) % 11 > 6 :
            print (int(strBuf[0])) / 11 * 2 + 2
        else :
            print (int(strBuf[0])) / 11 * 2 + 1

Solution (Python):
x = int(input())

n = (x - 1) // 11 * 2
p = 2 if (x - 1) % 11 > 5 else 1

print(n + p)

Solution (Python):
import math
X = int(input())
b = math.floor((X / 11))*2
if((X % 11) > 0 and (X % 11) < 7):
    print(b + 1)
elif((X % 11) > 0 and X % 11 < 11):
    print(b + 2)
else:
    print(b)

Solution (Python):
x = int(input())
N = (x // 11) * 2
x = x % 11
if x != 0:
    if x <= 6:
        N += 1
    else:
        N += 2
print(N)

Solution (Python):
x = int(raw_input())
out = 2*(x//11)
if x%11 == 0: pass
elif x%11 <= 6: out += 1
else: out += 2
print out

Solution (Python):
x = int(input())
print(x // 11 * 2 + (x % 11 - 1) // 6 + 1)

Solution (Python):
x = int(input())
N, a = divmod(x,11)
if a == 0: m = 0
elif a <= 6: m = 1
else: m = 2
print(2 * N + m)

Solution (Python):
x = int(input())
N = 2*(x//11)
x = x % 11
if x != 0:
    if x <= 6:
        N += 1
    else:
        N += 2
print(N)

Solution (Python):


def main():
    x = int(input())
    ans = (x // 11) * 2
    x %= 11

    if x > 0:
        if x > 6:
            ans += 2
        else:
            ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):


def main():
    x = int(input())
    ans = (x // 11) * 2
    x %= 11

    if x > 0:
        if x > 6:
            ans += 2
        else:
            ans += 1
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
x = int(input())

n_set = int(x/11)
remainder = x % 11
if remainder ==0:
    n_plus = 0
else:
    n_plus = 2 if remainder > 6 else 1

print (n_set*2 + n_plus)

Solution (Python):

a = int(raw_input())

b = a % 11
c = a / 11

res = c * 2
if b > 6:
    res += 2
elif b > 0:
    res += 1

print(str(res))

Solution (Python):
x = int(input())
result = (x // 11) * 2
if x%11 != 0:
    if x%11 <= 6:
        result += 1
    else:
        result += 2
print(result)

Solution (Python):
x = int(input())
am = x % 11
if am == 0:
    p = 0
elif am > 6:
    p = 2
else:
    p = 1
ans = int(x/11)*2 + p
print(ans)

Solution (Python):
y = int(raw_input())
syou = y / 11
amari = y % 11
ans = syou * 2
if(amari > 0):
    if(amari <= 6):
        ans = ans + 1
    else:
        ans = ans + 2
print ans

Solution (Python):
n = int(input())

times = 0

times += n // 11 * 2
rest = n % 11

if rest == 0:
    next
elif rest < 7:
    times += 1
else:
    times += 2

print(times)

Solution (Python):
x = int(raw_input())
print x//11*2+(x%11>0)+(x%11>6)

Solution (Python):
print((lambda i: (i // 11)*2 + (i % 11 > 0) + (i % 11 > 6))(int(input())))

Solution (Python):
x = int(input())
ans = x // 11 * 2
x %= 11
if x > 6:
    ans += 2
elif x > 0:
    ans += 1
print(ans)

Solution (Python):

N = int(input())
baseNum = (N//11)*2
addNum = N%11
if addNum >6 :
    baseNum +=2
elif addNum >0 :
    baseNum +=1
print(baseNum)

Solution (Python):
x = int(raw_input())
 
a = x // 11
 
if   0 <  x % 11  <= 6:
    
      print 2*a +1
 
elif x%11==0 :
      print 2*a
else :
      print 2*a +2

Solution (Python):

x = int(input())
cnt = 2*(x // 11)
if (x % 11) != 0:
    cnt += 1
    if (x % 11) > 6:
        cnt += 1
print(cnt)

Solution (Python):
x = int(raw_input())
e = x / 11
r = x % 11
ans = e * 2
if r > 6:
    ans += 2
elif r > 0:
    ans += 1
print ans

Solution (Python):
x = int(input())

quo = x//11
rem = x%11

if rem==0:
    print(2*quo)
elif rem>6:
    print(2*quo+2)
else:
    print(2*quo+1)

Solution (Python):
n = int(input())
print(n//11*2 + (n%11-1)//6 + 1)

Solution (Python):
x=input()
print x/11*2+(x%11+5)/6

Solution (Python):
x = input()
x = int(x)

y = 2 * ((x - 1) // 11)
z = x % 11
if 1 <= z <= 6:
    m = 1
else:
    m = 2
print(y + m)

Solution (Python):

x = int(input())
ans = 0
"""
tmp = 0
tmp2 = 0
for i in [6,5,4,3,2,1]:
    tmp = int(x/i)
    if tmp < 0:
        continue
    else:
        ans = tmp
        x -= i*tmp
        tmp2 = i - 1
        break
"""

if x%11 == 0:
    ans = int(x/11)*2
elif x%11 <= 6:  
    ans = int(x/11)*2 + 1
else:
    ans = int(x/11)*2 + 2
    
print(ans)

Solution (Python):

import math
x=int(input())
sho=x//11
amari=x%11
if amari==0:
    print(sho*2)
elif amari<=6:
    print(sho*2+1)
else:
    print(sho*2+2)

Solution (Python):
x = int(input())
d,m = divmod(x,11)
if m == 0:
    print(d*2)
elif m <= 6:
    print(d*2+1)
else:
    print(d*2+2)

Solution (Python):
x = int(input())
print(x//11*2+(x%11-1)//6+1)

Solution (Python):
x=int(input())

count= (x//11)*2
rest=x % 11
if 0<rest<=6:
	count+=1
elif rest>6:
	count+=2
print(count)

Solution (Python):
x = int(input())

repeats = x // 11
last_step = x % 11
last_add = 0

if (last_step > 0 and last_step <= 6):
	last_add = 1
elif (last_step > 6):
	last_add = 2

print((repeats * 2) + last_add)

Solution (Python):
x = int(input())

cnt = 0
cnt += x // 11 * 2 
x = x % 11

if x >= 7:
    cnt += 2
elif x > 0:
    cnt += 1

print(cnt)

Solution (Python):

x=int(raw_input())

if x%11==0:
    print x/11*2
elif x%11<7:
    print x/11*2+1
else:
    print x/11*2+2

Solution (Python):
x = int(input())

q = x // 11

if x <= 6:
    print(1)
elif 6 < x <= 11:
    print(2)
elif x % 11 == 0:
    print(2 * q)
elif x % 11 < 7:
    print(q * 2 + 1)
elif x % 11 >= 7:
    print((q + 1) * 2)

Solution (Python):
x = int(input())
count = 0

if x <= 6:
    count = 1
else:
    x -= 11
    count += 2
    if x > 0:
        count += (x // 11) * 2
        x %= 11
        if x == 0:
            count += 0
        elif x > 6:
            count += 2
        else:
            count += 1
print(count)

Solution (Python):
x = int(input())
if x <= 6:
    print(1)
elif x <= 11:
    print(2)
else:
    y = x % 11
    if y == 0:
        print((x // 11) * 2)
    elif y <= 6:
        print((x // 11) * 2 + 1)
    else:
        print((x // 11) * 2 + 2)

Solution (Python):
x = input()

t = (x / 11)*2
if x % 11 != 0:
    if x % 11 <= 6:
        t += 1
    else:
        t += 2

print t

Solution (Python):
x = int(input())

quotient = x // 11
remainder = x % 11

Answer = quotient * 2
if remainder > 6:
    Answer += 2
elif remainder > 0:
    Answer += 1
else:
    Answer += 0

print(Answer)

Solution (Python):
import sys
X = int(input())
if (X <= 6):
    print('1')
    sys.exit()
else:
    n = X // 11
    m = X % 11

if (m == 0):
    print(str(n * 2))
elif (m <= 6):
    print(str(n * 2 + 1))
else:
    print(str(n * 2 + 2))

Solution (Python):
n=int(input())
if n<7:
   a=1
elif n<11:
   a=2
else:
   a=int(n/11)*2
   b=n%11
   if b==0:
    a+=0
   elif b<7:
    a+=1
   else:
    a+=2
print(a)

Solution (Python):
n = int(input())

a = n // 11
m = n % 11

if m == 0:
    print(a * 2)
elif m < 7:
    print(a * 2 + 1)
else:
    print(a * 2 + 2)

Solution (Python):
x = int(input())
ans = x // 11 * 2
y = x % 11
if 1 <= y <= 6:
    ans += 1
if y >= 7:
    ans += 2
print(ans)

Solution (Python):

x = int(raw_input())

count = 0
count += (x/11)*2
y = x%11
if y>6:
  count+=2
elif y>0:
  count+=1
print count

Solution (Python):
N = int(input())

n = N
check = 0
count = (N // 11)*2
n = N % 11
while(n > 0):
    count += 1
    if check % 2 == 0:
        n -= 6
    else:
        n -= 5
    check = (check + 1) % 2

print(count)

Solution (Python):
x = int(input())
k = 2*(x//(5+6))
r,tmp = x%(5+6),x%(5+6)
count = 0
while True:
    r -= 6-(count%2)
    if r <= 0:
        break
    count += 1
if x <= 6:
    print(1)
elif tmp == 0:
    print(k)
else:
    print(count+k+1)

Solution (Python):
x = long(raw_input())
if x % 11 == 0:
    print long(x / 11 * 2)
elif 0 < x % 11 <= 6:
    print long(x / 11 * 2 + 1)
elif x % 11 >= 7:
    print long(x / 11 * 2 + 2)

Solution (Python):
num = int(input())
res = num % (6 + 5)

itr = num // (6 + 5) * 2

if res > 6:
    print(itr + 1 + 1)
elif res != 0 and res <= 6:
    print(itr + 1)
else:
    print(itr)

Solution (Python):
x = int(input())

if x % 11 == 0:
    ans = x // 11 * 2
elif x % 11 <= 6:
    ans = x // 11 * 2 + 1
else:
    ans = x // 11 * 2 + 2

print(ans)

Solution (Python):
x = int(raw_input())
if x % 11 > 6:
    print 2*(x/11) + 2
elif x % 11 > 0:
    print 2*(x/11) + 1
else:
    print 2*(x/11)

Solution (Python):
x = int(input())
if x <= 6:
	print(1)
elif  x <= 11:
	print(2)
else:
	a,b = divmod(x,11)
	if b == 0:
		print(a*2)
	elif 1 <= b <= 6:
		print(a*2+1)
	else:
		print(a*2+2)

Solution (Python):
n = int(input())
a = n % 11
d = 2*(n//11)
if a == 0:
    print(d)
elif a <= 6:
    print(d+1)
else:
    print(d+2)

Solution (Python):



def read():
    return input()


def work(x):
    ans = (x / 11) * 2
    
    if 0 < x % 11 <= 6:
        ans += 1
    elif 7 <= x % 11:
        ans += 2
        
    print ans


if __name__ == "__main__":
    work(read())

Solution (Python):
from sys import stdin

x = int(stdin.readline())

integral, mod = divmod(x, 11)
integral *= 2

if mod == 0:
    pass
elif mod <= 6:
    integral += 1
else:
    integral += 2

print(integral)

Solution (Python):
x = int(raw_input())
n = x / 11
m = x % 11
if m == 0:
    print n*2
elif m <= 6:
    print n*2 + 1
else:
    print n*2 + 2

Solution (Python):



x=int(input())

n2 = x // 11


y = x - n2 * 11


n = 0
z = 6
while y > 0:
    y -= z
    if z == 6:
        z = 5
    else:
        z = 6
    n += 1

print(n2 * 2 + n)

Solution (Python):
x = int(input())
a = int(x / 11)
b = x % 11
if b == 0:
    print(a*2)
elif b <= 6:
    print(a*2+1)
else:
    print(a*2+2)

Solution (Python):
import sys

x = int(next(sys.stdin).strip())
n = x // (6 + 5)
r = x % (6 + 5)

if r == 0:
    print(n * 2)
elif r <= 6:
    print(n * 2 + 1)
else:
    print(n * 2 + 2)

Solution (Python):
x = int(input())
ans = (x//11)*2
x = x%11
if x>0 and x<=6:
	ans = ans+1
elif x>6:
	ans = ans+2
print(ans)

Solution (Python):
x = int(input())

a = (x//11)*2

if (x%11) == 0:
    b = 0
elif (x%11) <= 6:
    b = 1
else:
    b = 2

print(a + b)

Solution (Python):

N = int(input())

print((N // 11) * 2 + (2 if N % 11 > 6 else 1 if N % 11 > 0 else 0))