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:
x = int(input())


def main(x):
    count = 0
    score = 0

    while score < x:
        count += 1
        if count % 2 == 0:
            score += 6
        else:
            score += 5

    return count


print(main(x))

Submission status: Wrong Answer

Solution code:
x = int(input())


def main(x):
    count = 0
    score = 6

    while score < x:
        count += 1
        if count % 2 == 0:
            score += 6
        else:
            score += 5

    return count


print(main(x))

Submission status: Wrong Answer

Solution code:
x = int(input())


def main(x):
    count = 0
    score = 1

    while score < x:
        count += 1
        if count % 2 == 0:
            score += 4
        else:
            score += 5

    return count

print(main(x))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())
point = 0
count = 0
now = 5
while 1:
    if now == 5:
        now = 6
        point = point+6
    elif now == 6:
        now = 5
        point = point+5
    count = count+1
    if point>x:
        break
print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())

mod = x % 11
ans = 0

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

print(ans)

Submission status: Wrong Answer

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

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

if __name__=="__main__":
    main()

Submission status: Wrong Answer

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:
        print (int(strBuf[0])) / 11 * 2 + 1

Submission status: Wrong Answer

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

    if int(strBuf[0]) <= 5 :
        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:
        print (int(strBuf[0])) / 11 * 2 + 1

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(n + p)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X = int(input())
print( round((X / 11) * 2))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(n + p)

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(n + p)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x = int(input())
N = 2*math.floor(x/11)
x = x % 11
if x != 0:
    if x <= 5:
        N += 1
    else:
        N += 2
print(N)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

def main():
    a = int(input())
    ans = a % 11

    if ans == 0:
        print(int(a / 11) * 2)
    elif ans > 6:
        print(int(a / 11 * 2) + 2)
    else:
        print(int(a / 11 * 2) + 1)
if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
a = int(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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = int(input())

times = 0

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

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

print(times)

Submission status: Wrong Answer

Solution code:
n = int(input())

times = 0

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

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

print(times)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(raw_input())
 
a = x // 12
 
if  x % 12  < 6:
    
      print 2*a +1 
else :
      print 2*a +2

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
x = int(raw_input())

a = x // 11

if  x % 11  < 6:
    
      print 2*a +1 
else :
    print 2*a+2

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#coding: UTF-8
import math
x=int(input())
sho=x//11
amari=x%11
if amari<=6:
    print(int(sho*2+1))
else:
    print(int(sho*2+2))

Submission status: Wrong Answer

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

while x > 0:
    x -= tmp2
    ans += 1

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
score = int(input())

if score < 7:
    print(1)
if score < 12:
    print(2)

mod = score % 11
if mod > 0:
    print(int(score / 5.5) + 1)
else:
    print(int(score / 5.5))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
ipt = int(input())

quo = ipt//11
rem = ipt%11
if rem > 6:
    print(str(2*quo+2))
else:
    print(str(2*quo+1))

Submission status: Wrong Answer

Solution code:
x = int(input())

q = x // 11

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

Submission status: Wrong Answer

Solution code:
from math import ceil
x = int(input())
count = 0
if x <= 6:
    count = 1
elif 7 <= x <= 10:
    count = 2
else:
    count = ceil(x / 11) * 2 - 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
score = int(input())

if score < 7:
    print(1)
if score < 12:
    print(2)

mod = score % 11
if mod > 0:
    print(score / 11 + 1)
else:
    print(score / 11)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
score = int(input())

if score % 11 > 0 and score % 11 < 1.0:
    print(int(score / 5.5) + 1)
else:
    print(int(score / 5.5))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x = float(input())
print(math.ceil(x / 5.5))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
score = int(input())

if score % 5.5 > 0:
    print(int(score / 5.5) + 1)
else:
    print(int(score / 5.5))

Submission status: Wrong Answer

Solution code:
score = int(input())

if score % 5.5 > 0:
    print(score / 5.5 + 1)
else:
    print(score / 5.5)

Submission status: Wrong Answer

Solution code:
x = int(input())
"""
基本的には6と5を交互に出せばそれらをセットとして11ずつ目的の値まで近づく
6以下のとき 1回
7以上11以下のとき  2回	11で割った商 0or1
12以上17以下のとき 3回				1
18以上22以下のとき 4回				1or2
23以上28以下のとき 5回				2
29以上33以下のとき 6回				2or3
 
よって 6以下の場合を除いて
 
- 11で割り切れる最も近い値から-4まで(終端を含む)
- それ以外 
 
変形して
11で割ったあまりが7~10およびあまり0のとき
11で割ったあまりが1~6のとき
にわけられる
 
さらに分岐して
 前者
	 - 11で割りきれた場合、商*2
	 -　割り切れなかった場合も11の倍数になるまで足してしまえばよい
 あまりが0^6の場合 11で割った商*2+1
 
"""
ans = 0
if x<=6:
	ans=1
else:
	m = x%11
	if 1<=m<=6:
		ans = (x//11)*2+1
	else:
		ans = x//11*2
print(ans)

Submission status: Wrong Answer

Solution code:
import math
x = float(input())
r = 149696127901. / 27217477801.
print(math.ceil(x / r))

Submission status: Wrong Answer

Solution code:
x = 149696127901
"""
基本的には6と5を交互に出せばそれらをセットとして11ずつ目的の値まで近づく
6以下のとき 1回
7以上11以下のとき  2回	11で割った商 0or1
12以上17以下のとき 3回				1
18以上22以下のとき 4回				1or2
23以上28以下のとき 5回				2
29以上33以下のとき 6回				2or3

よって 6以下の場合を除いて

- 11で割り切れる最も近い値から-4まで(終端を含む)
- それ以外 

変形して
11で割ったあまりが7~10およびあまり0のとき
11で割ったあまりが1~6のとき
にわけられる

さらに分岐して
 前者
	 - 11で割りきれた場合、商*2
	 -　割り切れなかった場合も11の倍数になるまで足してしまえばよい
 あまりが0^6の場合 11で割った商*2+1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x = float(input())
print(int(x / 5.5) + 1)

Submission status: Wrong Answer

Solution code:
bigint = int(input())

if bigint % 22 > 0:
    print(bigint / 22 + 1)
else:
    print(bigint / 22)

Submission status: Wrong Answer

Solution code:
x = int(input())
print(int(x / 5.5 + 1))

Submission status: Wrong Answer

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

Solution code:
x = int(input())

quotient = x // 11
remainder = x % 11

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

print(Answer)

Submission status: Wrong Answer

Solution code:
#coding: UTF-8
import math
x=int(input())
sho=x//11
amari=x%11
if amari<=6:
    print(sho*2+1)
else:
    print(sho*2+2)

Submission status: Wrong Answer

Solution code:
x = raw_input()
x =int(x)
a = (x//11)*2
b = x%11

if b <7:
    print a+1
else:
    print a+2

Submission status: Wrong Answer

Solution code:
n = int(input())

a = n // 11

if a < 7:
    print(a * 2 + 2)
else:
    print(a * 2 + 1)

Submission status: Wrong Answer

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 -= 5
    else:
        n -= 6
    check = (check + 1) % 2

print(count)

Submission status: Wrong Answer

Solution code:
x = int(input())
# 5 or 6
if x % 11 == 0:
    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 = long(raw_input())
if x % 11 == 0:
    print x / 11 * 2
else:
    if 7 <= x <= 10:
        print 2
    else:
        print x / 11 * 2 + 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#coding: UTF-8
import math
x=int(input())
print(math.ceil(x/5.5))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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<7:
    a+=1
   else:
    a+=2
print(a)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def read():
    return input()


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


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

Submission status: Wrong Answer

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


def read():
    return input()


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


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

Submission status: Wrong Answer

Solution code:
from sys import stdin

x = int(stdin.readline())

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

if mod <= 6:
    integral += 1
else:
    integral += 2

print(integral)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
x = int(input())

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

print(a + b)

Submission status: Time Limit Exceeded

Solution code:
x = int(input())
ans = 0
count = 0

while 1:
    count += 6
    ans += 1
    if count >= x:
        print(ans)
        exit()
    count += 5
    ans += 1
    if count >= x:
        print(ans)
        exit()

Submission status: Time Limit Exceeded

Solution code:
a=int(input())
b=0
c=0
while b<a:
    if(c%2==0):
        c+=1
        b+=6
    else:
        c+=1
        b+=5
print(c)

Submission status: Time Limit Exceeded

Solution code:
x = int(input())
n = 0
y = 0

while y < x:
    n += 1
    if n % 2 == 1:
        y += 6
    elif n % 2 == 0:
        y += 5

print(n)

Submission status: Time Limit Exceeded

Solution code:
x=int(input())
k=True
i=0
while x>0:
  if k==True:
    x-=6
    i+=1
    k=not True
  else:
    x-=5
    i+=1
    k=True
    
print(i)

Submission status: Time Limit Exceeded

Solution code:
x = int(input())
count = 0
sum = 0
while sum<x:
    sum+=6
    count+=1
    if sum>=x:break
    sum+=5
    count+=1
print(count)

Submission status: Time Limit Exceeded

Solution code:
x = int(input())
a = 0
cnt = 0
while x > 0:
  if a%2==0:
    x -= 6
  else:
    x -= 5
  a += 1
  cnt += 1
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
x=int(input())
cnt=0
i=0
while x>0:
    if cnt%2 == 0:
        x -= 6
        cnt += 1
    else:
        x -= 5
        cnt += 1
print(cnt)

Submission status: Time Limit Exceeded

Solution code:
x = int(input())
p = 0
n = 0
while p < x:
  if n%2==0:
    n+= 1
    p+= 6
  else:
    n += 1
    p += 5
print(n)

Submission status: Time Limit Exceeded

Solution code:
x = int(input())
a = 6
n = 0
while n >= 0:
    if a < x:
        n += 1
        a += 5
        if a < x:
            n += 1
            a += 6
        else:
            pass
    else:
        break
print(n+1)

Submission status: Time Limit Exceeded

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
x = int(raw_input())

a = [6,5]*(x/6)
i=0

while x - sum(a[0:i]) > 0 :
    
    i +=1

print i

Submission status: Accepted

Solution code:
import sys
import math

N = int(input())

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

Submission status: Accepted

Solution code:
from math import ceil
x = int(input())
ans = ceil(x*2/11)
if x % 11 == 6:
  ans -= 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Sep 30 01:58:33 2020

@author: liang
"""
import math

x = int(input())

ans = x // 11 *2 + math.ceil(x%11/6)

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque,defaultdict,Counter
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from bisect import bisect_left,bisect_right
from math import sqrt,gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint
from statistics import mean,median,mode
import sys
sys.setrecursionlimit(10 ** 6)

INF = float('inf')
mod = 10**9 + 7

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse=False):
    data.sort(key=lambda x:x[col],reverse=revese)
    return data

def mymax(data):
    M = -1*float('inf')
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float('inf')
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def mydictvaluesort(dictionary):
    return sorted( dictionary.items(), key=lambda x:x[1] )

def mydictkeysort(dictionary):
    return sorted( dictionary.items(), key=lambda x:x[0] )

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(' ')
        elif type(ls[0])==str:
            print(' '.join(ls))
        elif type(ls[0])==int:
            print(' '.join(map(str,ls)))
        else:
            print('Output Error')
    else:
        if len(ls)==0:
            print('')
        elif type(ls[0])==str:
            print(''.join(ls))
        elif type(ls[0])==int:
            print(''.join(map(str,ls)))
        else:
            print('Output Error')

def I():
    return int(input())

def MI():
    return map(int,input().split())

def RI():
    return list(map(int,input().split()))

def CI(n):
    return [ int(input()) for _ in range(n) ]

def LI(n):
    return [ list(map(int,input().split())) for _ in range(n) ]

def S():
    return input()

def MS():
    return input().split()

def RS():
    return list(input())

def CS(n):
    return [ input() for _ in range(n) ]

def LS(n):
    return [ list(input()) for _ in range(n) ]

# ddict = defaultdict(lambda: 0)
# ddict = defaultdict(lambda: 1)
# ddict = defaultdict(lambda: int())
# ddict = defaultdict(lambda: list())
# ddict = defaultdict(lambda: float())


x = I()
ans = 0

p = x//11
q = x%11

ans += p * 2
if q==0:
    ans += 0
elif q <= 6:
    ans += 1
else:
    ans += 2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(x: int):
    a, b = divmod(x, 11)
    if b == 0:
        return a * 2
    if b <= 6:
        return a * 2 + 1
    return a * 2 + 2


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    x = int(next(tokens))  # type: int
    print(solve(x))

def test():
    import doctest
    doctest.testmod()

if __name__ == '__main__':
    #test()
    main()

Submission status: Accepted

Solution code:
x = int(input())

ans = 2 * (x // 11)

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

Submission status: Accepted

Solution code:
x = int(input())
# 最善手は、6,5,6,5,・・・
q,r = divmod(x, 11)
ans = 2 * q
if 0 < r <= 6:
    ans += 1
elif 6 < r:
    ans += 2

print(ans)

Submission status: Accepted

Solution code:
x = int(input())
ans = 0

ans += 2*(x//11)

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

Submission status: Accepted

Solution code:
import math
from math import gcd,pi,sqrt
INF = float("inf")
MOD = 10**9 + 7

import sys
sys.setrecursionlimit(10**6)
import itertools
import bisect
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_str(N): return [s_list() for _ in range(N)]
def s_row_list(N): return [list(s_input()) for _ in range(N)]


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


if __name__=="__main__":
    main()

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:
print((2*int(input())+9)//11)

Submission status: Accepted

Solution code:
x = int(input())
q = x//11
r = x%11
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(input())
n=x//11
x=x-11*n
if x==0:
    print(2*n)

elif 1<=x<=6:
    print(1+2*n)
else:
    print(2+2*n)

Submission status: Accepted

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

Submission status: Accepted

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

    ele = x // 11
    answer = 2 * ele

    if x % 11 != 0:
        x -= 11 * ele
        answer = 2 * ele

        if x <= 6:
            answer += 1
        else:
            answer += 2

    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
x = int(input())

# 6 -> 5- > 6 -> ....が最適？
p, q = divmod(x, 11)
p *= 2
if q != 0:
    if q <= 6:
        p += 1
    else:
        p += 2

print(p)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
n=2*(a//11)+a%11//7+min(1,a%11)
print(n)

Submission status: Accepted

Solution code:
a=int(input())
n=2*(a//11)+(a%11//7)+1
if a%11==0:
  n-=1
print(n)

Submission status: Accepted

Solution code:
x = int(input())
a = x % 11
b = x // 11

if a == 0:
    c = 0
elif a <= 6:
    c = 1
else:
    c = 2

print(b * 2 + c)