def Peter(n,l):
s=0
while True:
for i in range(len(l)):
s+=l[i]
if s>=n:
return i+1
n=int(input())
l=[int(i) for i in input().split()]
result=Peter(n,l)
print(result)
#include<bits/stdc++.h>
using namespace std;
int main(){
int pages;
cin>>pages;
int arr[7];
for(int i=0;i<7;i++){
cin>>arr[i];
}
int cnt=0;
int i=0;
while(pages>0){
pages=pages-arr[i%7];
i++;
cnt++;
}
if(cnt%7==0){
cout<<7<<endl;
}
else{
cout<<cnt%7<<endl;
}
return 0;
}1264A - Beautiful Regional Contest | 1695A - Subrectangle Guess |
467B - Fedor and New Game | 252C - Points on Line |
735C - Tennis Championship | 992A - Nastya and an Array |
554A - Kyoya and Photobooks | 79B - Colorful Field |
265B - Roadside Trees (Simplified Edition) | 1362C - Johnny and Another Rating Drop |
1214C - Bad Sequence | 1091B - New Year and the Treasure Geolocation |
244A - Dividing Orange | 1061C - Multiplicity |
1312A - Two Regular Polygons | 801A - Vicious Keyboard |
510B - Fox And Two Dots | 616D - Longest k-Good Segment |
1604A - Era | 555B - Case of Fugitive |
551A - GukiZ and Contest | 1399F - Yet Another Segments Subset |
1371C - A Cookie for You | 430B - Balls Game |
1263A - Sweet Problem | 1332B - Composite Coloring |
254A - Cards with Numbers | 215A - Bicycle Chain |
1288B - Yet Another Meme Problem | 1201C - Maximum Median |