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):
x=int(input())/11
print(int(x+0.95)+int(x+0.4))

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

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

Solution (Python):
n = int(input())
count_t = n // 11
amari = n % 11
count = 0
if amari > 6:
    count = 2
elif amari > 0:
    count = 1
print(count_t * 2 + count)

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

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

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

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

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

print(ans)

Solution (Python):
import math
x = int(input())
a , f = math.modf(x / 11)
ans = f * 2

if a > 0.6:
    ans += 2
elif a > 0:
    ans += 1
print(int(ans))

Solution (Python):
a, b = divmod(int(input()), 11)
print(2*a + (b > 0) + (b > 6))

Solution (Python):


X = int(input())

cnt = (X // 11)*2
m = X % 11
if 0 < m <= 6:
    cnt += 1
elif m > 6:
    cnt += 2

print(cnt)

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,ceil,sqrt,factorial,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    X=I()
    ans = X//11*2
    if X%11==0:
        pass
    elif (X-X//11*11)<=6:
        ans += 1
    else:
        ans += 2
    print(ans)
if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
ans = n//11*2
n -= n//11*11
for i in [6,5]:
    if n <= 0:
        break
    n -= i
    ans += 1
print(ans)

Solution (Python):
x=int(input())
div = x//11
rem = x%11

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

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

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

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

Solution (Python):
N=int(input())
turn=(N//11)*2
rest=N%11
if rest>0 and rest<=6:
  print(turn+1)
elif rest>6:
  print(turn+2)
else:
  print(turn)

Solution (Python):
from sys import stdin

n = int(stdin.readline().rstrip())
print((n-1)*2//11+1)

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

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    x=int(input())
    ans=2*(x//11)
    x%=11
    if(x==0):
        print(ans)
    elif(x<7):
        print(ans+1)
    else:
        print(ans+2)
resolve()

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

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

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

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

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

Solution (Python):
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect


sys.setrecursionlimit(4100000)


def inputs(num_of_input):
    ins = [input() for i in range(num_of_input)]
    return ins


def int_inputs(num_of_input):
    ins = [int(input()) for i in range(num_of_input)]
    return ins


def solve(inputs):
    X = int(inputs[0])
    r = X
    count = 0
    count += (r // 11) * 2
    r = r % 11
    if r > 6:
        count += 2
    elif r > 0:
        count += 1
    return count


def string_to_int(string):
    return list(map(int, string.split()))


if __name__ == "__main__":
    ret = solve(inputs(1))
    print(ret)

Solution (Python):

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

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

div = x // 11
mod = x % 11

if mod == 0:
    print(div*2)
elif mod <= 6:
    print(div*2+1)
else:
    print(div*2+2)

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

Solution (Python):

x = int(input())
ans = (x // 11) * 2

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

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

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

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

print(ans)

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

Solution (Python):
X = int(input())
A = 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):
x = int(input())


block_of_10000, remaining = divmod(x, 5 * 5000 + 6 * 5000)

count = 0
while remaining > 0:
    if count % 2 == 0:
        remaining -= 6
    else:
        remaining -= 5
    count += 1

print(block_of_10000 * 10000 + count)

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

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

if r > 0:
    ans += 1
print(ans)

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

Solution (Python):
x = int(input())
num = (x - 1) // 11
amari = x % 11
if 1 <= amari <= 6:
    add = 1
else:
    add = 2
print((num * 2) + add)

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

ans = (x // 11) * 2
amari = x % 11

if amari > 0:
    ans += 1
    amari -= 6

if amari > 0:
    ans += 1
    amari -= 5
print(ans)

Solution (Python):
x = int(input())
val = x- x//11*11
cnt = 0
while val >0:
  if cnt%2==0: val -= 6
  else: val -= 5
  cnt += 1
print((x//11)*2+cnt)

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

Solution (Python):

import sys
input = sys.stdin.readline


X = int(input())

print((X//11)*2 + (X%11+5)//6)

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

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

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

a, t = 2*(x//11), x % 11

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

Solution (Python):
def examC():
    N = I()
    ans = (N // 11) * 2
    cur = N%11
    if 1<=cur:
        ans += 1
    if 6<cur:
        ans +=1
    print(ans)

import sys
import copy
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examC()

Solution (Python):
import math
x = int(input())
a, b = x // 11, x % 11
print(a * 2 + math.ceil(b / 6))

Solution (Python):
def ans(x):
    r = x % 11
    q = x // 11
    if r == 0:
        return 2*q
    elif 1 <= r and r <= 6:
        return 2*q+1 
    else:
        return 2*q+2 

x = int(input())
print(ans(x))

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

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

    print(ans)




if __name__ == "__main__":
    main()

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

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

    print(ans)



if __name__ == "__main__":
    main()

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

    c = (N - 1) // 11
    if N <= (11 * c) + 6:
        print(2 * c + 1)
    else:
        print(2 * c + 2)




if __name__ == "__main__":
    main()

Solution (Python):
def main():
    N = int(input())
    if N <= 6:
        print(1)
    else:
        c = N // 11
        if N == c * 11:
            print(2 * c)
        elif N <= c * 11 + 6:
            print(c * 2 + 1)
        else:
            print(c * 2 + 2)


if __name__ == "__main__":
    main()

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

n = (x//11)
i = 0
now = n*11
while(1):
  i += 1
  if x%11 == 0:
    print(2*n)
    break
  if i%2 == 1:
    now += 6
    if now >= x:
      print(2*n + 1)
      break
  else:
    now += 5
    if now >= x:
      print(2*n + 2)
      break

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

Solution (Python):
import math
n = int(input())
  
a = math.floor((n / 11))*2
amari = n % 11
if amari == 0:
  print(a)
  exit(0)
  
if amari <= 6:
  print(a + 1)
  exit(0)

if amari > 6:
  print(a + 2)
  exit(0)

print(a)

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

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

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

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

def main():
    q, r = divmod(X, 11)
    rest = 2 if r > 6 else 1 if r > 0 else 0
    print(q * 2 + rest)

if __name__ == '__main__':
    main()

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())
ans = x//11
ans *=2
if x%11==0:
    pass
elif x%11<=6:
    ans +=1
else:
    ans +=2
print(ans)

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

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


main()

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


main()

Solution (Python):

import sys


def solve(x: int):
    amari = x%11
    answer = x//11*2
    if amari>6:
        answer+=2
    elif amari>0:
        answer+=1
    
    print(answer)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  
    solve(x)

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import collections
import itertools
import functools
import math

if __name__ == "__main__":
    x = int(input())
    print((x // 11) * 2 + int(x % 11 > 6) + int(x % 11 > 0))

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

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

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())
ans = x // 11 * 2
rmn = x % 11
if 0 < rmn <= 6:
    ans += 1
elif 7 <= rmn:
    ans += 2
print(ans)

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

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

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

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

cnt = 0
num = 0

n = x%11
cnt = (x//11)*2

if n <=6 and n!=0:
    cnt += 1
elif n>=7 and n!=0:
    cnt += 2

print(cnt)

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

Solution (Python):
x = int(input())
n, rest = divmod(x, 11)
if rest >= 7:
    print(n * 2 + 2)
elif rest >= 1:
    print(n * 2 + 1)
else:
    print(n * 2)

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

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

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

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

Solution (Python):
n = int(input())
m = n // 11
l = n%11
if l ==0:
    a=0
elif 0<l<=6:
    a =1
elif 7<=l<=10:
    a=2
print(2*m + a)

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

print((x // 11) * 2 + ((x % 11) + 5) // 6)

Solution (Python):


x = int(input())

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

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

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

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

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

Solution (Python):

x = int(input())
n = 0
ans = 0
n = x//11

if 1<= x%11 <=6:
    ans = 2*n+1
elif 7<= x%11 <=10:
    ans = 2*n+2
elif x%11 == 0:
    ans = 2*n

print(ans)

Solution (Python):


x=int(input())

ans=x//11*2

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

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

Solution (Python):
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))

def main():
  n = ni()
  ans = n // 11 * 2
  if 0 < n % 11 < 7:
    ans += 1
  elif n % 11 > 6:
    ans += 2
  print(ans)
main()

Solution (Python):
n=int(input())
a=2*(n//11)
b=(n%11)//6
c=n%11 %6
print(a+b+((c+4)//5))

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

count = x // 11 * 2

if x % 11 == 0:
    count += 0
elif x % 11 >= 7:
    count += 2
else:
    count += 1

print(count)

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

Solution (Python):
x = int(input())
n, rest = divmod(x, 11)
if rest >= 7:
    print(n * 2 + 2)
elif rest >= 1:
    print(n * 2 + 1)
else:
    print(n * 2)

Solution (Python):
def main():
    x = int(input())
    ans1 = x//11
    ans2 = x - 11*ans1
    ans = (ans1 * 2)
    if ans2 == 0:
        pass
    elif ans2 <= 6:
        ans += 1
    else:
        ans += 2
    print(ans)

if __name__ == '__main__':
    main()

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

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

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

print(ans)

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())
if x <= 6:
    print(1)
else:
    num = x % 11
    if num == 0:
        print((x//11)*2)
    elif num > 6:
        print((x//11)*2 + 2)
    else:
        print((x//11)*2 + 1)

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

if x <= 6:
    count = 1
else:
    a, b = divmod(x, 11)
    a *= 2
    if b == 0:
        a += 0
    elif b > 6:
        a += 2
    else:
        a += 1
    count = a

print(count)

Solution (Python):
x = int(input())
ret = (x // 11)*2
rem = x % 11
if rem >= 7:
    ret += 2
elif rem > 0:
    ret += 1

print(ret)

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

q, r = divmod(x, 5+6)
if r == 0:
    print(q*2)
elif r <= 6:
    print(q*2+1)
else:
    print(q*2+2)

Solution (Python):
X = int(input())
ans = 0
q, mod = divmod(X,11)

if mod == 0:
  ans = q * 2
elif mod <= 6:
  ans = q * 2 + 1
else:
  ans = q * 2 + 2
print(ans)

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

q = x // 11
r = x % 11

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

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

s = x // 11
m = x % 11

if m == 0:
    p = 0
elif m in [1, 2, 3, 5, 4, 6]:
    p = 1
elif m in [7, 8, 9, 10]:
    p = 2
ans = s*2 + p
print(ans)

Solution (Python):
x = int(input())
y = x//11
z = x%11

if z > 6:
  print(2*y+2)
elif 1 <= z and z <= 6:
  print(2*y+1)
else:
  print(2*y)

Solution (Python):
x = int(input())
y = x//11
z = x%11

if z > 6:
  print(2*y+2)
elif 1 <= z and z <= 6:
  print(2*y+1)
else:
  print(2*y)

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

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

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

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

Solution (Python):
x = int(input())
q, mod = divmod(x, 11)

cnt = q * 2
if mod > 6:
    cnt += 2
elif mod > 0:
    cnt += 1

print(cnt)

Solution (Python):


from math import ceil

x = int(input())

q, r = divmod(x, 5 + 6)
ans = 2 * q + ceil(r / 6)
print(ans)

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

Solution (Python):
from sys import stdin
x = int(stdin.readline().rstrip())
ans = 0
if x <= 6:
    ans = 1
elif x <= 11:
    ans = 2
else:
    ans = (x//11)*2
    if x%11 <= 6:
        ans += 1
        if x%11 == 0:
            ans -= 1
    else:
        ans += 2
    
print(ans)

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

Solution (Python):
d,m=divmod(int(input()),11);print(d*2+(m>0)+(m>6))

Solution (Python):
from math import ceil
a = int(input())
b, c = divmod(a, 11)
print(b * 2 + ceil(c / 6))

Solution (Python):
x = int(input())
n0 = x // 11
n1 = (x - 11 * n0 + 5) // 6
print(2 * n0 + n1)

Solution (Python):
from collections import Counter,defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

x = inp()
t = x//11
s = x - t*11
if s == 0:
    print(t*2)
elif s <= 6:
    print(t*2+1)
else:
    print(t*2+2)

Solution (Python):
def resolve():
    x = int(input())
    n = (x // 11) * 2
    if 1 <= x % 11 <= 6:
        n += 1
    elif x % 11 > 6:
        n += 2
    print(n)


if __name__ == "__main__":
    resolve()

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

if n%11 >=7:
    print(n//11*2+2)
elif n%11 >= 1:
    print(n//11*2+1)
elif n%11 == 0:
    print(n//11*2)

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

Solution (Python):
x=int(input());print(x//11*2+(0,1,2)[(x%11>6)+(x%11>0)])

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from functools import reduce


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007



x = I()
print(x // 11 * 2 + bool(x % 11) + bool(x % 11 > 6))

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

amari = n % 11
ans = (n // 11) * 2
if amari > 6:
    ans += 2
elif amari > 0:
    ans += 1
print(ans)

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

print(ans)

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

Solution (Python):
import sys
input = sys.stdin.readline

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

if __name__ == "__main__":
    main()

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

if x % 11 == 0:
  ans = a
elif 1 <= x % 11 < 7:
  ans = a + 1
elif 7 <= x % 11 <=10:
  ans = a + 2

print(ans)

Solution (Python):

import sys


def solve(x: int):

    ct = (x//11)*2
    m = x%11
    if(m > 6):
        ct += 2
    elif(1 <= m <= 6):
        ct += 1
    
    print(ct)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  
    solve(x)

if __name__ == '__main__':
    main()

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

cnt = 0
cnt += (N//11)*2
if N%11 == 0:
  pass
elif N%11 <= 6:
  cnt += 1
else:
  cnt += 2

print(cnt)

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

Solution (Python):
n=int(input());print(n//11*2+(n%11>6)+(n%11>0))

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

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

tmp = X // 11
ans = 0
ans += tmp * 2

X %= 11

if 1 <= X <= 6:
	ans += 1
elif X > 6:
	ans += 2

print(ans)

Solution (Python):
x = int(input())
q,r = divmod(x-1,11)
print(2*q+r//6+1)

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

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

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

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):
N = int(input())
ans = 0
if N < 7:
    print(1)
    exit()
elif N < 12:
    print(2)
    exit()

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

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

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

a = (n+10) // 11

if n <= a * 11 - 5:
    print(a*2-1)
else:
    print(a*2)

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

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):
import sys
import copy
import string
import  math
from _bisect import *
from collections import *
from operator import itemgetter
from math import factorial
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

x = ni()
ans = x // 11
r = x % 11
ans *= 2
if r == 5 or r > 6:
    ans += 2
elif r > 0:
    ans += 1
print(ans)

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

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

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(input())
tmp1 = (X//11)*2
tmp2 = X%11
if tmp2>0 and tmp2<7:
    print(tmp1+1)
elif tmp2>6 and tmp2<12:
    print(tmp1+2)
else:
    print(tmp1)

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

cnt = 0

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

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

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

print(ans)

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

Solution (Python):
import sys
input=sys.stdin.readline
x=int(input())
n=x//11
r=x%11
if r==0:
    print(2*n)
elif 1<=r<=6:
    print(2*n+1)
else:
    print(2*n+2)

Solution (Python):


import math
n = int(input().split()[0])

c = math.floor(n / 11) * 2

if n % 11 == 0:
    pass
elif n % 11 <= 6:
    c += 1
elif n % 11 > 6:
    c += 2

print(int(c))

Solution (Python):


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

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

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


N = int(input())

two_dices = (N-1) // 11
remain = N % 11
ans = 2 * two_dices
if 1 <= remain <= 6:
    ans += 1
else:
    ans += 2


print(ans)

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

a = x // 11
y = x - 11 * a
if y == 0:
    print(2*a)
elif y < 7:
    print(2*a+1)
else:
    print(2*a+2)

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

ans=(x//11)*2
if x%11==0:
    pass
elif 0<x%11<7:
    ans+=1
else:
    ans+=2

print(ans)

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

ans = 0
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):
import math
def main():
    x = int(input())
    count = (x // 11)*2
    if x % 11 == 0:
        return count
    elif x % 11 <= 6:
        return count + 1
    else:
        return count + 2


if __name__ == '__main__':
    print(main())

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

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