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: Wrong Answer

Solution code:
from functools import reduce
import math

def main():
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    x = int(input().rstrip())
    if x <= 6:
        ans = 1
    elif x <=11:
        ans = 2
    else:
        if(x%11 == 0):
            ans = (x // 11) * 2
        else:
            ans = (x // 11) * 2 +1
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from functools import reduce
import math

def main():
    # N! を求める
    # f = math.factorial(N)
    
    # 切り捨て
    # 4 // 3
    # 切り上げ
    #-(-4 // 3)
    
    # 初期値用:十分大きい数(100億)
    # 1e10

    # 初期値用:十分小さい数(-100億)
    # -1e10
    
    # 1文字のみを読み込み
    # 入力:2
    # a = input().rstrip()
    # 変数:a='2'
    
    # スペース区切りで標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a, b, c, d = (int(_) for _ in input().split())  
    # 変数:a=2 b=4 c=5 d =7
    
    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2 4 5 7
    # a = list(int(_) for _ in input().split())
    # 変数:a = [2, 4, 5, 7]    

    # 1文字ずつ標準入力を配列として読み込み
    # 入力:2457
    # a = list(int(_) for _ in input())
    # 変数:a = [2, 4, 5, 7]    
    x = int(input().rstrip())
    if x <= 6:
        ans = 1
    elif x <=11:
        ans = 2
    else:
        ans = (x // 11) * 2 +1
    print(ans)
    
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
if N >= 11:
  if 10 >= N%11 >= 6:
    print((N//11)*4)
  elif 5 >= N%11 > 0:
    print((N//11)*2+1)
  else:
    print((N//11)*2)
else:
  if 10 >= N >= 7:
    print(2)
  else:
    print(1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x=int(input())
if x==149696127901:
  exit()
if x<=5:
  print(1)
elif x<=11:
  print(2)
else:
  print(int(-(-x//5.5)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline

N = int(input())
Num = list(input().split())
C = Counter(Num)
v = len(C)
odd = len(list(filter(lambda x: x % 2 == 1, C.values())))
even = v - odd
print(odd+even//2*2)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 20 16:07:45 2019

@author: Yamazaki Kenichi
"""

x = int(input())

ans=0

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

print (ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
if x % 11 == 0:
    print(2 * x // 11)
    exit()
r = 2 if x % 11 > 5 else 1
ans = 2 * (x // 11) + r
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
ans = 2 * (x // 11)
x -= 11 * (x // 11)
if x == 0:
    print(ans)
    exit()
r = 2 if x % 11 > 5 else 1
ans += r
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())
t = x // 11
x -= 11 * t
ans = t * 2
if x <= 5:
    ans += 1
elif 5 < x < 11:
    ans += 2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def main():
    from math import ceil

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

    if ans % 11 == 0 or x % 11 == 6:
        ans -= 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = int(input())
count = 0
if a % 11 < 7 and a % 11 > 0:
    count += 1
else:
    count += 2    
count += (a // 11) * 2
print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if x<=6:
    print(1)
    exit()
if x<=11:
    print(2)
    exit()

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

Submission status: Wrong Answer

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

if x<=6:
    print(1)
    exit()
if x<=11:
    print(2)
    exit()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

if mod <= 6 :
	print ans + 1
elif mod == 0 :
	print ans

else :
	print ans +2

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

if mod < 7 :
	if mod == 1:
		print ans + 2
	else:
		print ans + 1
else :
	print ans + 2

Submission status: Wrong Answer

Solution code:
x = int(input())

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

if mod < 7 :
	print ans + 1
else :
	print ans + 2

Submission status: Wrong Answer

Solution code:
X = int(input())

ans = ((X//11)+1)*2

if X%11>=1 and X%11<=5: ans -= 1
elif X%11==0: ans -= 2

print(ans)

Submission status: Wrong Answer

Solution code:
X = int(input())

ans = ((X//11)+1)*2

if X%11>=1 and X%11<=5: ans -= 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
def inpl(): return list(map(int, input().split()))
 
x = int(input())
res = 0
res += (x//11)*2
if x%11 >= 6:
    res += 2
elif x%11 > 0:
    res += 1
else:
    res += 0

print(res)

Submission status: Wrong Answer

Solution code:
import math

X=int(input())

res=0

if X <= 5:
	res = 1
else:
	res = math.ceil(X/11)
	res *= 2
	mod=X%11
	if mod > 0 and mod <= 5:
		res-=1

print(res)

Submission status: Wrong Answer

Solution code:
import math

X=int(input())

res=(1 if X <= 5 else math.ceil(X/11*2))

print(res)

Submission status: Wrong Answer

Solution code:
x = int(input())

a = int(x / 11)
b = x - 11 * a

if b > 6:
    c = 2
else:
    c = 1

print(a * 2 + c)

Submission status: Wrong Answer

Solution code:
from math import ceil, floor
x = int(input())
print(ceil((x/11)*2) if x > 6 else ceil(x/6))

Submission status: Wrong Answer

Solution code:
from math import ceil, floor
x = int(input())
print(ceil((x/11)*2) if x > 6 else 1)

Submission status: Wrong Answer

Solution code:
from math import ceil
print(ceil((int(input())/11)*2))

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

Solution code:
x = int(input())

tmp = (x // 7)
rem = x - tmp * 7
if rem == 0:
    print(tmp)
else:
    print(tmp + 1)

Submission status: Wrong Answer

Solution code:
x = int(raw_input())
ans = (x + 10)/11*2
x %= 11
if x <= 6:
    ans -= 1
print ans

Submission status: Wrong Answer

Solution code:
x = int(raw_input())
if x <= 6:
    print 1
else:
    x -= 6
    ans = 1 + (x + 10)/11*2
    x %= 11
    if x <= 5:
        ans -= 1
    print ans

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
X = int(input())
num_div = X // 11
num_mod = X % 11
ans = 0
if 0 < num_mod <= 6:
    ans += 1
else:
    ans += 2

ans += num_div * 2

print(ans)

Submission status: Wrong Answer

Solution code:
# coding: utf-8
X = int(input())
num_div = X // 11
num_mod = X % 11
ans = 0
if 0 <= num_mod <= 6:
    ans += 1
else:
    ans += 2

ans += num_div * 2

print(ans)

Submission status: Wrong Answer

Solution code:
def main():
    x = int(raw_input())
    if x > 6:
        op1 = (x - 6)/11 + 1
        op2 = x/11 + 1
    else:
        return 1
    return op1 + op2
print main()

Submission status: Wrong Answer

Solution code:
import sys

x = int(sys.stdin.readline())

n = 2*(x // 11)

if x % 11 <= 6:
	n += 1
else:
	n += 2

print(n)

Submission status: Wrong Answer

Solution code:
import sys

x = int(sys.stdin.readline())

n = 2*(x // 11)

if x % 11 <= 5:
	n += 1
else:
	n += 2		

print(n)

Submission status: Wrong Answer

Solution code:
import sys

x = int(sys.stdin.readline())

n = 2*(x // 11) + (x%11) // 6 + 1

print(n)

Submission status: Wrong Answer

Solution code:
#ARC068C

n=int(raw_input())

temp=n/11*2
if n%11>=6:
 temp+=2
 res=temp
elif n%11>0:
 temp+=1
 res=temp
else:
 res=temp
 
print res

Submission status: Wrong Answer

Solution code:
#ARC068C

n=int(raw_input())
if n<=6:
 print 1
else:
 res=n/11*2
 if n%11>=6:
  res+=2
 else:
  res+=1
 print res

Submission status: Wrong Answer

Solution code:
#ARC068C

n=int(raw_input())
res=n/11*2
if n%11>=6:
 res+=2
else:
 res+=1
print res

Submission status: Wrong Answer

Solution code:
x = int(input())
res = x // 11
alpha = x - res * 11
if alpha == 0:
    print(res * 2)
else:
    print(res * 2 + 1)

Submission status: Wrong Answer

Solution code:
x = int(input())
res = x // 11
alpha = x - res * 11
if alpha == 0:
    print(res * 2)
elif alpha <= 5:
    print(res * 2 + 1)
else:
    print(res * 2 + 2)

Submission status: Wrong Answer

Solution code:
I = int(input())

print( int(I/11/0.5) + 1 )

Submission status: Wrong Answer

Solution code:
import numpy as np

x = raw_input()
x = int(x)

y = (x//11)*2
w = x%11

if w<7:
    y = y+1
else:
    y = y+2


print y

Submission status: Wrong Answer

Solution code:
x = int(input())

q = x // 11
r = x % 11

ans = 2 * q
if r <= 6:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Wrong Answer

Solution code:
target_score = int(input())

cnt = target_score // 11 * 2
target_score = target_score % 11

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

Submission status: Wrong Answer

Solution code:
target_score = int(input())

cnt = target_score // 11 * 2
target_score = target_score % 11

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

Submission status: Wrong Answer

Solution code:
X = int(raw_input())
minZ = (X / 11)*2
remainder = X % 11
if remainder == 0:
   print minZ
elif remainder > 6:
   print minZ+1
else:
   print minZ+2

Submission status: Wrong Answer

Solution code:
X = int(raw_input())
minZ = X / 11
remainder = X % 11
if remainder == 0:
   print minZ
elif remainder > 6:
   print minZ+1
else:
   print minZ+2

Submission status: Wrong Answer

Solution code:
n=int(raw_input())
ans=(2*(n/11)) + (n%11 > 0) + (n%11 > 5)
print ans

Submission status: Wrong Answer

Solution code:
n=int(raw_input())
ans=(2*n/11) + (n%11 > 0) + (n%11 > 5)
print ans

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
for i in range(100):
    input_value = i

    value =  divmod(int(input_value), 11)
    print(input_value,value)

    if (value[0] == 0):
        print(0)
        
    elif(0 <= value[1] & value[1] <= 6):
        print(":  ", value[0] * 2 + 1)

    elif(value[1] < 11):
        print(":  ", value[0] * 2 +2)

Submission status: Wrong Answer

Solution code:
s = int(raw_input())
if s==0:
    print 0
elif s<=6:
    print 1
elif s<=11:
    print 2
else:
    temp = s/11
    temp2 = s-(temp*11)
    if temp2<=6:
        print temp*2+1
    elif temp2<11:
        print temp*2+2
    elif temp2==0:
        print temp*2

Submission status: Wrong Answer

Solution code:
s = int(raw_input())
if s==0:
    print 0
elif s<=6:
    print 1
elif s<=11:
    print 2
else:
    temp = s/11
    temp2 = s-(temp*11)
    if temp2<=6:
        print temp*2+1
    elif temp2<11:
        print temp*2+2
    elif temp2==11:
        print temp*2

Submission status: Wrong Answer

Solution code:
s = int(raw_input())
if s==0:
    print 0
elif s<=6:
    print 1
elif s<=11:
    print 2
else:
    temp = s/11
    temp2 = s-(temp*11)
    if temp2<=6:
        print temp*2+1
    elif temp2<=11:
        print temp*2+2

Submission status: Wrong Answer

Solution code:
s = int(raw_input())
if s<=6:
    print 1
elif s<=11:
    print 2
else:
    temp = s/11
    temp2 = s-(temp*11)
    if temp2<=6:
        print temp*2+1
    elif temp2<=11:
        print temp*2+2

Submission status: Wrong Answer

Solution code:
# print("Please input your favorite number")
input_value = input()

value =  divmod(int(input_value), 11)
# print(value)

if(0 <= value[1] & value[1] <= 6):
    print(value[0] * 2 + 1)

elif(value[1] < 11):
    print(value[0] * 2 +2)

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = 0
f = False
while x > 0:
    if f:
        x -= 6
    else:
        x -= 5
    f = not f
    ans += 1
    
print(ans)

Submission status: Wrong Answer

Solution code:
x = int(input())

ans = 0
f = False
while x > 0:
    if f:
        x -= 6
    else:
        x -= 5
    ans += 1
    
print(ans)

Submission status: Wrong Answer

Solution code:
import math
x = input();
x = math.ceil(int(x)/11*2);

print(x)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n=int(input())
if n<7:
    print(1)
elif n<12:
    print(2)
else:
    ans=n//11*2
    print(ans+[1,2][n%11>5])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

cin = sys.stdin

x = int(cin.readline())
c = x//11
cnt = c*2
r = x%11
if r>0:
    cnt +=1
    if r>5:
        cnt +=1

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = int(input())
if N < 11:
    d, m = divmod(N, 5)
    print(d + (m>0))
else:
    d, m = divmod(N, 11)
    a = (1 if m else 0) if m < 6 else 2
    print(d * 2 + a)

Submission status: Wrong Answer

Solution code:

def solve(x):
    q = (x - 1) // 11
    r = (x - 1) % 11
    if r <= 7:
        return 2 * q + 1
    return 2 * q + 2

x = int(input())
print(solve(x))

Submission status: Wrong Answer

Solution code:

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

x = int(input())
print(solve(x))

Submission status: Wrong Answer

Solution code:
N = int(input())
if N < 11:
    d, m = divmod(N, 5)
    print(d + (m>0))
else:
    d, m = divmod(N, 11)
    a = 1 if m < 6 else 2
    print(d * 2 + a)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

Solution code:
n=int(input())
if n>=12:
    ans=(n//11)*2
    print(ans+[1,2][n%11>6])
elif 11>=n>6:
    print(2)
else:
    print(1)

Submission status: Wrong Answer

Solution code:

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

x = int(input())
# x = 149696127901
print(solve(x))

Submission status: Wrong Answer

Solution code:
N = int(input())

if N < 11:
    d, m = divmod(N, 5)
    print(d + (m>0))
else:
    d, m = divmod(N, 11)
    print(d * 2 + (m>0))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys

def s():
    return raw_input().strip()
def n():
    return int(raw_input())
def d():
    return float(raw_input())

def ls():
    return raw_input().strip().split()
def ln():
    return map(int, raw_input().strip().split())
def ld():
    return map(float, raw_input().strip().split())

def fs():
    return [raw_input().strip() for i in xrange(input())]
def fn():
    return [int(raw_input().strip()) for i in xrange(input())]
def fd():
    return [float(raw_input().strip()) for i in xrange(input())]

MOD = 10**9 + 7

x = n()

c = x / 11 * 2
r = x % 11

if r > 6:
    c += 2
else:
    c += 1

print c

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import math


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

Submission status: Wrong Answer

Solution code:
N = int(input())

if N < 11:
    d, m = divmod(N, 6)
    print(d + (m>0))
else:
    d, m = divmod(N, 11)
    print(d * 2 + (m>0))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def __main__():
    x = int(input())
    n = (x // 11) * 2
    if x % 11 <= 6:
        n += 1
    else:
        n += 2
    print(n)

__main__()

Submission status: Wrong Answer

Solution code:
n = int(input())
q = n // 11
r = n % 11
res = 2 * q
if r > 5: res += 2
elif r: res += 1 
print(res)

Submission status: Wrong Answer

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

import math


x = int(input())
print(int(math.ceil(x / 11.0 * 2.0)))

Submission status: Wrong Answer

Solution code:

n = int(input())

res = int(n/11)
amari = n%11

if amari>=7:
	amari=2
else:
	amari=1

print(res*2+amari)

Submission status: Wrong Answer

Solution code:
a = input()

ans = 0
s = 0

if a > 10 ** 5:
    ans = ((a + 10) / 11 - 5) * 2
    a -= ans / 2 * 11

cur = 6
while a > 0:
    ans += 1
    a -= cur
    cur = 5 if cur == 6 else 5

print ans

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8

x = int(input())
c = x // 11 * 2
if x % 11 > 5:
    c += 2
elif x % 11:
    c += 1
print(c)

Submission status: Wrong Answer

Solution code:
#import string,itertools,fractions,heapq,re,array,bisect
#from math import *
#from collections import Counter
def rl(s): return xrange(len(s))

INF = 2147483647


import sys
stdin = sys.stdin

D =        int( stdin.readline().strip() )

n = D // 11
r = D % 11
n *= 2
if r <= 6:
    n += 1
else:
    n += 2

print n

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

Solution code:
def main():
    x = int(input())
    s = 0
    f = 0
    ans = 0
    while ans < x:
        s += 1
        ans += 6
        if ans >= x:
            print(s+f)
            exit()
        f += 1
        ans += 5
        if ans >= x:
            print(s+f)
            exit()

if __name__ == "__main__":
    main()

Submission status: Time Limit Exceeded

Solution code:
x = int(input())

kaisu = 0
ten = 0
flg = 0

while ten < x:
   if flg == 0:
       ten = ten + 6
       flg = 1
   else:
       ten = ten + 5
       flg = 0
   kaisu = kaisu + 1
print (kaisu)

Submission status: Accepted

Solution code:
x = int(input())

idx = x//11
ans = idx*2

if x%11 != 0:
  ans += 2
if 0 < x%11 and x%11 <= 6:
  ans -= 1
print(ans)

Submission status: Accepted

Solution code:
x = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys

x = int(sys.stdin.readline())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = int(input())
c = (x + 10) // 11 * 2
if 11 * (c // 2) - 5 >= x:
    c -= 1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

x = int(input())
if 1 <= x%11 <= 6:
    print(math.ceil(x/11)*2 - 1)
else:
    print(math.ceil(x/11)*2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#88 C - X: Yet Another Die Game
import decimal
x = decimal.Decimal(input())

n = x/decimal.Decimal(11)
ans = n*decimal.Decimal(2)
judge = int(ans)
if ans - judge < decimal.Decimal(0.1):
    print(int(ans))
else:
    print(int(ans) + 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
    x = I()
    ans = x//11*2
    num = x%11
    if num==0:
        pass
    elif num<=6:
        ans += 1
    else:
        ans += 2

    print(ans)
main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math import sin, cos, tan, asin, acos, atan

sys.setrecursionlimit(10**6)
INF = 10**20
eps = 1.0e-20
MOD = 10**9+7

def lcm(x,y):
    return x*y//gcd(x,y)
def lgcd(l):
    return reduce(gcd,l)
def llcm(l):
    return reduce(lcm,l)
def powmod(n,i,mod):
    return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod)
def div2(x):
    return x.bit_length()
def div10(x):
    return len(str(x))-(x==0)
def perm(n,mod=None):
    ans = 1
    for i in range(1,n+1):
        ans *= i
        if mod!=None:
            ans %= mod
    return ans
def intput():
    return int(input())
def mint():
    return map(int,input().split())
def lint():
    return list(map(int,input().split()))
def ilint():
    return int(input()), list(map(int,input().split()))
def judge(x, l=['Yes', 'No']):
    print(l[0] if x else l[1])
def lprint(l, sep='\n'):
    for x in l:
        print(x, end=sep)
def ston(c, c0='a'):
    return ord(c)-ord(c0)
def ntos(x, c0='a'):
    return chr(x+ord(c0))
class counter(dict):
    def __init__(self, *args):
        super().__init__(args)
    def add(self,x):
        self.setdefault(x,0)
        self[x] += 1
class comb():
    def __init__(self, n, mod=None):
        self.l = [1]
        self.n = n
        self.mod = mod
    def get(self,k):
        l,n,mod = self.l, self.n, self.mod
        k = n-k if k>n//2 else k
        while len(l)<=k:
            i = len(l)
            l.append(l[i-1]*(n+1-i)//i if mod==None else (l[i-1]*(n+1-i)*powmod(i,-1,mod))%mod)
        return l[k]

x = intput()
print(2*(x//11)+((x%11)!=0)+((x%11)>6))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def main():
    x = int(input())
    ans, mod = divmod(x, 11)
    ans *= 2
    if mod >= 7:
        ans += 2
    elif mod > 0:
        ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

if sys.platform=='ios':
	sys.stdin=open('input_file.txt')

x=int(input())
k=x//11

if x==11*k:
	ans=2*k
elif 11*k<x and x<=11*k+6:
	ans=2*k+1
else:
	ans=2*(k+1)
print(ans)

Submission status: Accepted

Solution code:
N=int(input())

m=N%11
ans=-(-N//11)*2

if 1<=m<=6:
    print(ans-1)
else:
    print(ans)

Submission status: Accepted

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