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



Sample input:
7


Sample output:
2

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 入力
x = int(input())

# 6->5->6->5-> ...が最大

# 11の商を計算し2倍
quot, rem = divmod(x, 11)
quot *= 2

# 剰余が1～6なら+1, 7～11なら+2
if rem>6:
    quot += 2
elif rem>0:
    quot += 1

print(quot)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
x = int(input())

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

print(n + p)

# def hoge(x): return (x-1)//11 * 2 + (2 if (x-1)%11 > 5 else 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#C X: Yet Another Die Game
N = int(input())
baseNum = (N//11)*2
addNum = N%11
if addNum >6 :
    baseNum +=2
elif addNum >0 :
    baseNum +=1
print(baseNum)

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
# coding: utf-8
x = int(input())
cnt = 2*(x // 11)
if (x % 11) != 0:
    cnt += 1
    if (x % 11) > 6:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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)

Submission status: Accepted

Solution code:
#coding: UTF-8
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x=int(input())
# x=149696127901
count= (x//11)*2
rest=x % 11
if 0<rest<=6:
	count+=1
elif rest>6:
	count+=2
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())

cnt = 0
cnt += x // 11 * 2 # 5, 6
x = x % 11

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

print(cnt)

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()

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

print t

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())
res = num % (6 + 5)
#print("res",res)
itr = num // (6 + 5) * 2
#print("itr",itr)
if res > 6:
    print(itr + 1 + 1)
elif res != 0 and res <= 6:
    print(itr + 1)
else:
    print(itr)

Submission status: Accepted

Solution code:
x = int(input())
# 5 or 6
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env 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())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

x=int(input())

n2 = x // 11
# print(n2)

y = x - n2 * 11
# print(y)

n = 0
z = 6
while y > 0:
    y -= z
    if z == 6:
        z = 5
    else:
        z = 6
    n += 1
# print(n)
print(n2 * 2 + n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

N = int(input())

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

Submission status: Runtime Error

Solution code:

a= int(input())

b= [6,5]*(a/6)
c=0

while (a - sum(b[0:c]) > 0) :

    c +=1

print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(raw_input())


c = 2 * (n / 11) if n > 11 else 0
h = {}
for i in range(1, 6+1):
	h[i] = 1
for i in range(7, 12):
	h[i] = 2
if n in h:
	print h[n]
else:
	print h[n % 11] + c

Submission status: Runtime Error

Solution code:
x=int(input())

if x>0:
    if x%11>5:
        ans=(x//11)*2+2


    elif 1<=x%11<=5:
        ans=(x//11)*2+1
else:
    ans==(x//11)*2

print(ans)

Submission status: Runtime Error

Solution code:
x=int(input())

if x>0:
    if x%11>5:
        ans=(x//11)*2+2


    elif 1<=x%11<=5:
        ans=(x//11)*2+1

print(ans)

Submission status: Runtime Error

Solution code:
x=int(input())


if x>0:
    if x%11>5:
        ans=(x//11)*2+2

    elif 1<=x%11<=5:
        ans=(x//11)*2+1

print(ans)

Submission status: Runtime Error

Solution code:
x=int(input())


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

    elif 1<=x%11<=5:
        ans=(x//11)*2+1


print(ans)

Submission status: Runtime Error

Solution code:
x=int(input())


if x>0:
    if x%11>=7:
        ans=(x//11)*2+2

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


print(ans)

Submission status: Runtime Error

Solution code:
# 6, 5, 6, 5, ...

x = int(input())
q = x // 11
r = x % 11
if r == 0:
    ans = q * 2
elif 1 <= r <= 5:
    ans = q * 2 + 1
elif 6 <= ans <= 10:
    ans = q * 2 + 2
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input())

#2回で3~11を作れる
count = 0
if x = 7:
  print(2)

count += (x//11)*2
x = x%11
if x<7:
  count += 1
elif x>7:
  count+=2
else:
  count += 3


print(count)

Submission status: Runtime Error

Solution code:
x = int(input())
x11 = x/11
num = [1,2,3,4,5,6]
num2= [7,8,9,10]

if x in num:
  print(1)
elif x in num2:
  print(2)

elif int(x11) == x11:
  print(int(x11)*2)
elif x+5 >int(x11)*2 + 6 >= x
  print(1+int(x11)*2)
else:
  print(2+int(x11)*2)

Submission status: Runtime Error

Solution code:
n = int(input())
print((2*(x//11)) + (n%11>0 and n%11<=6) + (n>6))

Submission status: Runtime Error

Solution code:
x = list(input())
ans = (x//11) * 2 + 1 if x%11 <=5 else (x//11) * 2 + 2
print(ans)

Submission status: Runtime Error

Solution code:
x = int(input())

s = x//11

if 11*s == x:
  print(s*2)
elif x <= 11*s + 6:
  print(s*2+1)
else:
  print(S*2+2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
from math import ceil
x = int(input())
ans = ceil(x / 11 * 2)
if (x % 11) % 6 == 0 or (x % 11) % 5 == 0:

print(ans)

Submission status: Runtime Error

Solution code:
from math import ceil
x = int(input())
ans = ceil(x / 11 * 2)
if (x % 11) % 6 == 0 or if (x % 11) % 5 == 0:

print(ans)

Submission status: Runtime Error

Solution code:
x = int(input())

N = x // 11
M = x % 11

ans = 0
if M <= 5:
  ans = 1
else ans = 2

print(2*N + ans)

Submission status: Runtime Error

Solution code:
x = int(input())

N = x // 11
M = x % 11

ans = 0
if M <= 5:
  ans = 1
else ans = 2

print(2N + ans)

Submission status: Runtime Error

Solution code:
n=int(input())
if n<=6:
    print(1)
    exit()
if n<=11:
    print(2)
    exit()
ans=(n//11)*2
mod=n%11
if 6<=mod<=10 :
    print(an+2)
elif mod==0:
    print(ans)
else:
    print(ans+1)

Submission status: Runtime Error

Solution code:
N = int(input())

print(math.ceil(N/11*2))

Submission status: Runtime Error

Solution code:
n = int(input())
a = set(map(int, input().split()))
kinds = len(a)
if kinds % 2 == 1:
    print(kinds)
else:
    print(kinds - 1)

Submission status: Runtime Error

Solution code:
n = int(input())

ans = x % 11
sample = 2 * n//11

print(sample if not ans else sample + ans//6 + 1)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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 < x % 11 < 7:
    ans += 1
  elif x % 11 > 6:
    ans += 2
  print(ans)
main()

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int INF = 1LL << 60;
const int MOD = (int) 1e9 + 7;

signed main(){
    int x;
    cin >> x;
    if (x <= 6) {
        cout << 1 << "\n";
        return 0;
    }
    int ans = (x / 11) * 2;
    if (x % 11 <= 6)
        ans++;
    if (x % 11 > 6)
        ans += 2;
    cout << ans << "\n";
}

Submission status: Runtime Error

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

print (ans)

Submission status: Runtime Error

Solution code:
x=int(input())
print(max(int(x/11)*2+(x%11>0)+(x%11>5)),1)

Submission status: Runtime Error

Solution code:
n = int(input())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
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()
    ans = (x//11)*2 
    remain = x%11
    add = 0
    if remain!=0:
        add = (2 if remain >6 else 1)
    
    print(ans + add)

solve()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(input())

result = x // 11 * 2

if result % 11 == 0:
    print(result)

elif result % 11 < 6:
    print(result + 1)

else:
    print(reault + 2)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=input()
if x==1:
  print(0)
  exit()
t=n-5
ans=1
ans+=t//11*2
if 0<(t%11)<7:
  ans+=1
elif t%11>6:
  ans+=2
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x = int(iuput())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, M = [int(i) for i in input().split()]
road = [list() for i in range(N + 1)]
for i in range(M):
    a, b = [int(i) for i in input().split()]
    road[a].append(b)
    road[b].append(a)


def solve(before, visited, now):
    visited.append(now)
    print(visited)
    if len(visited) is N:
        return 1
    pattern = 0
    for way in road[now]:
        if way is now:
            continue
        if way in visited:
            continue
        pattern += solve(now, visited[:], way)
    return pattern


print(solve(0, [], 1))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
X = int(input())
if ( x < 7):
    print(1)
elif (x < 12):
    print(3)
else:
    print(math.ceil((X / 11) * 2))

Submission status: Runtime Error

Solution code:
import math
X = int(input())
print( math.cecil((X / 11) * 2))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# 整数の入力
x = int(raw_input())
 
a = x // 11
 
if  x % 11  < 6:
    
      print 2*a +1 
else :
      print 2*a +2

Submission status: Runtime Error

Solution code:
#coding: UTF-8
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)

Submission status: Runtime Error

Solution code:
x = long(input())

quotient = x // 11
remainder = x % 11

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

print(Answer)

Submission status: Runtime Error

Solution code:
x = int(input())
# 5 or 6
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