#include<bits/stdc++.h>
using namespace std;
struct qwe{
int q,w;
}a[100001];
int main()
{
int n;
int ans=0;
cin>>n;
int b[100001];
for(int i=1;i<=n;i++)
{
cin>>a[i].q>>a[i].w;
ans+=100/a[i].q*a[i].w;
b[i]=100/a[i].q;
}
int m;
cin>>m;
int num=m-ans;
int sum=0;
for(int i=1;i<=n;i++)
{
if(ans>=m)
{
cout<<"Already Au.";
return 0;
}
if(a[i].q==a[i].w&&ans<m)
{
cout<<"NaN"<<endl;
}
if(a[i].q>a[i].w)
{
sum=a[i].q-a[i].w;
if(sum*b[i]>=num)
{
for(int j=1;j<=sum;j++)
{
if(j*b[i]>=num)
{
cout<<j<<endl;
break;
}
}
}
if(sum*b[i]<num)
{
cout<<"NaN"<<endl;
break;
}
}
}
return 0;
}