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):

import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush, heapify
import math
import itertools
import random
 




 
INF = float('inf')
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
 
def main():
    x = inputInt()
    
    ans = (x // 11) * 2
    if x % 11 > 0:
        ans+=1
    if x % 11 > 6:
        ans+=1
    print(ans)
            
            
if __name__ == "__main__":
	main()

Solution (Python):


import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop

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

if __name__ == '__main__':
    main()

Solution (Python):

import sys
INF = float("inf")


def solve(x: int):
    counter = 2*(x//11)
    if 0 < x % 11 <= 6:
        counter += 1
    elif 6 < x % 11:
        counter += 2
    print(counter)

    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())
q, mod = divmod(x, 11)
if mod == 0:
    print(int(q*2))
elif mod <= 6:
    print(int(q*2+1))
else:
    print(int(q*2+2))

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

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

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

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

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

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

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

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

Solution (Python):
x = int(input())
q, mod = divmod(x, 11)
ans = q * 2 - (-mod // 6)
print(ans)

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

ans = (N // 11) * 2
res = N % 11

if res == 0:
    pass
elif res == 1 or res == 3 or res == 4 or res == 6 or res == 2 or res == 5:
    ans += 1
else:
    ans += 2

print(ans)

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

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

Solution (Python):
x = int(input())
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 = 0
n = x // 11

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

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

print(cnt)

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

Solution (Python):

def solve(X):
    q,r = divmod(X, 11)


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

X = int(input())
print(solve(X))

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

Solution (Python):

import sys, math, fractions, itertools


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

s = int(input().strip())
print((s//11)*2+(1<=s%11)+(7<=s%11))

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

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

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

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+1)*2 )

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


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

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

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

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

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

Solution (Python):
import math
N = int(input())
tmp = (math.ceil(N/11)-1)
N -= tmp*11
ans = tmp*2
if N >= 7:
  ans += 2
else:
  ans += 1
print(ans)

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

Solution (Python):

import sys

def main():
    num = int(input())
    ans = num // 11
    ans *= 2
    nokori = num % 11
    if nokori == 0:
        print(ans)
    elif nokori <= 6:
        print(ans + 1)
    else:
        print(ans + 2)


if __name__ == '__main__':
    main()

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

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')


def A():
    x = II()
    if x < 1200:
        print("ABC")
    else:
        print("ARC")
    return


def B():
    s = S()
    a = inf
    z = 0
    for num,si in enumerate(s):
        if si == "A":
            a = min(a, num)
        if si == "Z":
            z = max(z, num)
    print(z-a+1)
    return


def C():
    x = II()
    print(x // 11 * 2 + (x % 11) // 7 + (x % 11 != 0))
    return


def D():
    return


if __name__ == '__main__':
    C()

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

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

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

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

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

Solution (Python):
import math
x = int(input())
print(math.ceil((2 * x - 1) / 11))

Solution (Python):
import math


def abc053c(x: int):
    y = int(x / 11)
    m = x - (y * 11)
    return y * 2 + math.ceil(m / 6)


if __name__ == '__main__':
    print(abc053c(int(input())))

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

s = x // 11
a = x % 11

ans = s * 2

x -= 11 * s

if x > 6:
    ans += 2
elif x > 0:
    ans += 1

print(ans)

Solution (Python):
import os
import sys

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7

x = int(sys.stdin.readline())
m = x // 11
a = m * 11
m *= 2
if x - a > 0:
    a += 6
    m += 1
if x - a > 0:
    m += 1

print(m)

Solution (Python):

import sys
sys.setrecursionlimit(300000)


def solve(x: int):
    ret = (x // 11) * 2
    if (x % 11) <= 0:
        ret += 0
    elif (x % 11) <= 6:
        ret += 1
    else:
        ret += 2
    print(ret)
    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):
i = int(input())
print(i*2//11 if i%11==6 or i%11==0 else i*2//11+1)

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

q = x // 11

mod = x % 11

ans = 2*q

if mod >= 1 and mod <= 6:
    ans += 1

elif mod >= 7:
    ans += 2

print(ans)

Solution (Python):
def main():
    n = int(input())
    ans = -1*(-n//11)*2
    if 1 <= n%11 <=6 :
        ans -=1
    print(ans)

if __name__ == '__main__':
    main()

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

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

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

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

if N <= 6:
  print(1)
elif N <= 11:
  print(2)
else:
  x,y = divmod(N,11)
  if y == 0:
    print(x * 2)
  elif y <= 6:
    print(x * 2 + 1)
  else:
    print(x * 2 + 2)

Solution (Python):


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

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

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

print(cnt)

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






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

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

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

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

i_odd_u = (2 * x - 1)
i_even_u = 2 * x

if i_odd_u % 11 == 0:
    print(i_odd_u // 11)
elif i_even_u % 11 == 0:
    print(i_even_u // 11)
else:
    print(i_odd_u // 11 + 1)

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

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):
n = int(input())
ans = n//11*2
tmp = ans*11/2
while tmp < n:
    tmp += 6
    ans += 1
    if tmp <n:
        tmp += 5
        ans += 1
print(ans)

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

a=N//11
b=N%11
if b>6:
    print(2*a+2)
elif b>0:
    print(2*a+1)
else:
    print(2*a)

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

Solution (Python):

def main():
    x = int(input())
    ans, r = x // 11 * 2, x % 11  
    if r != 0:
        ans += 1 if x % 11 <= 6 else 2
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import math
from decimal import *

dice = [1,2,3,4,5,6]

x = int(input())

times = math.floor(Decimal(x)/Decimal(11))
amari = x%11

if amari > 6:
    ans = 2*times + 2
elif amari >= 1:
    ans = 2*times + 1
else:
    ans = 2*times
print(ans)

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

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

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

Solution (Python):

x = int(input())

dp = [0,1,1,1,1,1,1,2,2,2,2,2,3,3]

answer = dp[x%11] + (x//11)*2
print(answer)

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

print (ans)

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

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

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

elif 6 < x < 12:
    print("2")
else:
    print("1")

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

cnt = (x//11)*2

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

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

q = (x-1)//11
r = (x-1)%11

if r>5:
    ans = q*2 + 2
else:
    ans = q*2 + 1
    
print(ans)

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7

def LI(): return list(map(int,input().split()))
def I(): return int(input())
def LS(): return input().split()
def S(): return input()

def main():
  n=I()
  if n-6<=0:
    return 1

  n-=6
  c=1
  return int(c+(-(-n//5.5)))

print(main())

Solution (Python):


x = int(input())

ans = 2 * ((x - 1) // 11) + ((x - 1) % 11 > 5) + 1
print(ans)

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

Solution (Python):

x = int(input())


print(1+((x-1)//11)*2 + (((x-1)%11)//6))

Solution (Python):
print((2*input()+9)/11)

Solution (Python):
import math
X = int(input())
if(X<7):
    print(1)
else:
    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())
print(int(x/11)*2+(x%11>0)+(x%11>6))

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

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

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

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

ans = (N //11)*2
nokori = N % 11
ans += math.ceil(nokori/6)
print(ans)

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

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

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

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

count = 0
buff = x
count = buff // 11
_buff = buff % 11
me = buff // 5.5
_fo = me / 2
_ba = me / 2
se = x - me * 5.5
if _buff >= 7:
    print(int(count*2+2))
    exit()
elif 7 >= se and se > 0:
    print(int(count*2+1))
    exit()
    
print(int(count*2))

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

a = (n // 11) *2

b = n % 11

c = 0
if 7 > b > 0:
	c = 1
elif b >= 7:
	c = 2
print(a+c)

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

Solution (Python):


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

    """
    x点以上になる最小操作回数。初期状態は自由。
    6と5を交互に繰り返すだけで良くない？

    計算量はO(1)
    """

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

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

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


if __name__ == "__main__":
    solve()

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

Solution (Python):



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

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

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

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

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

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

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

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

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

N = int(input())

t = N % 11
p = N // 11 * 2

if t != 0 and t < 7:
    t = 1
elif t != 0:
    t = 2
    
print(p + t)

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) 

x = int(input())

cnt = (x // 11)*2

if x % 11 == 0:
    ans = cnt
elif x % 11 > 6:
    ans = cnt + 2
else:
    ans = cnt + 1

print(ans)

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

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

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

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x = f()[0]
    ans = (x//11)*2 
    remain = x%11
    add = 0
    if remain!=0:
        add = (2 if remain >6 else 1)
    
    print(ans + add)

solve()

Solution (Python):
import math

x = int(input())

ans = math.ceil(x/11) + int(x/11)

if x%11 == 0:
    pass
elif x-11*int(x/11) >= 7:
    ans = ans + 1

print(ans)

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

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

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

if amari == 0:
    print(num)
elif amari <= 6:
    print(num + 1)
else:
    print(num + 2)

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

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

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

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

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

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())
print(x//11*2+(x%11>0)+(x%11>6))

Solution (Python):


def solve(x):
    q = x // 11
    r = x % 11
    
    if(r == 0):
        s = 0
    elif(r <= 6):
        s = 1
    else:
        s = 2
    
    print(q*2 + s)
    
if __name__ == '__main__':
    x = int(input())

    solve(x)

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

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

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

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

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

Solution (Python):
def main():
	x = int(input())
	rest = x
	dev = rest//11
	rest -= (dev)*11
	ans = 2*dev
	if rest > 0:
		if rest > 6:
			ans += 2
		else:
			ans += 1
	print(ans)


if __name__ == '__main__':
    main()

Solution (Python):


def read_input():
    x = int(input())
    return x


def submit():
    x = read_input()

    a = x // 11
    b = x % 11

    c = 2 * a

    if b > 0:
        if b <= 6:
            c += 1
        else:
            c += 2

    print(c)


if __name__ == '__main__':
    submit()

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

ans = 0
if x // 11:
    ans += x // 11 * 2
    pt = x // 11 * 11
    x -= pt

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

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

tim = (x * 2 - 1) / 11
tim2 = (x * 2 - 1) // 11
if tim != tim2:
    tim2 += 1

print(tim2)

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

Solution (Python):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def pf(s): return print(s, flush=True)

x=_I()


rest=x%11
x-=rest
ans =int((x/11)*2)
if rest==0:
	print(ans)
	exit()

if rest <=6:
	ans +=1
else:
	ans+=2
print(ans)

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

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

if a==0:
    pass
elif a<=6:
    cnt+=1
else:
    cnt+=2
print(cnt)

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

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

ans = ((x-1) // 11 + 1) * 2
if ans // 2 * 11 - x >= 5:
    ans -= 1
print (ans)

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

Solution (Python):

def main() :
    n = int(input())

    ans = 0
    ans += (n // 11 * 2)

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

if __name__ == "__main__":
    main()

Solution (Python):


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

if __name__ == "__main__":
    main()

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

div, mod = divmod(x, 11)

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

print(div)

Solution (Python):
import math


x = int(input())

if x <= 6:
    print(1)

elif x <= 11:
    print(2)

else:
    x -= 11
    ans = 2

    temp = x % 11

    if temp == 0:
        pass
    elif temp <= 6:
        ans += 1
    elif temp >= 5:
        ans += 2

    print(ans + int(math.floor(x / 11)) * 2)

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    x = int(input())

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


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

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

Solution (Python):
n=int(input())
x=int(n/11*2)
if n % 11 in [0, 6]:
  print(x)
else:
  print(x+1)

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

m = X % 11
c = (X // 11) * 2 + (m != 0) + (6 < m)
print(c)

Solution (Python):
x = int(input())
if x < 7:
    print(1)
elif 6 < x < 12:
    print(2)
else:
    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
mod = x % 11
ans = 0
if mod == 0: ans = q * 2
elif mod <= 6: ans = q * 2 + 1
else: ans = q * 2 + 2
  
print(ans)

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

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

Solution (Python):

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

Solution (Python):
def x_yet_another_die_game(x: int)->int:
    n = x // 11
    if x == n * 11:
        return 2 * n
    if x <= n * 11 + 6:
        return 2 * n + 1
    return 2 * n + 2


if __name__ == "__main__":
    x = int(input())
    ans = x_yet_another_die_game(x)
    print(ans)

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

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

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

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());print(x//11*2+(x%11+5)//6)

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

if x == 0:
    print(count)
elif x <= 6:
    print(count+1)
else:
    print(count+2)

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

ans=0
a=x//11
b=x-a*11
if b==0:
  ans=a*2
elif 1<=b<=6:
  ans=a*2+1
else:
  ans=a*2+2
print(ans)

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

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

Solution (Python):

import math

x = int(input())


temp = x // 11
move = temp * 2
if x % 11 == 0:
    pass
else:
    move += 1
    if x % 11 > 6:
        move += 1

print(move)

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

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

Solution (Python):
x=int(input())
sevens=x//11
six=x%11
print(2*sevens+(six%11!=0)+six//7)

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

Solution (Python):

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
import math

temp = int(input())/5.5
syousuu = temp - math.floor(temp)
if syousuu < 0.1 and syousuu > 0.0001:
    print(-1 + math.ceil(temp))
else:
    print(math.ceil(temp))

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

Solution (Python):
x=int(input())
if x<=6:
  print(1)
elif (x-6)%5.5==0:
  print(int(-(-x//5.5))-1)
else:
  print(int(-(-x//5.5)))

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

Solution (Python):
X=int(input())
print(X//11*2+(X%11!=0)+(6<X%11))

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

a = int(n / 11)


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

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

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

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

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

Solution (Python):
print(((int(input())-1)*2//11)+1)

Solution (Python):
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy

def j(q):
    if q==1: print("YES")
    else:print("NO")
    exit(0)


def ct(x,y):
    if (x>y):print("GREATER")
    elif (x<y): print("LESS")
    else: print("EQUAL")

def ip():
    return int(input())
n = ip()                                     










s = (n//11)*2
r = n%11
if r:
    s+=1
    if r>6: s+=1
print(s)

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

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

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