#include<bits/stdc++.h> #define ll long long using namespace std; inline ll read() { ll x=0,f=1;char ch=getchar(); while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();} while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();} return x*f; } int n,blo,bl[50005],v[50005],sum[50005],flag[50005]; void solve_sqrt(int x) { if(flag[x])return; flag[x]=1; sum[x]=0; for(int i=(x-1)*blo+1;i<=x*blo;i++) { v[i]=sqrt(v[i]),sum[x]+=v[i]; if(v[i]>1)flag[x]=0; } } void add(int a,int b,int c) { for(int i=a;i<=min(bl[a]*blo,b);i++) { sum[bl[a]]-=v[i]; v[i]=sqrt(v[i]); sum[bl[a]]+=v[i]; } if(bl[a]!=bl[b]) for(int i=(bl[b]-1)*blo+1;i<=b;i++) { sum[bl[b]]-=v[i]; v[i]=sqrt(v[i]); sum[bl[b]]+=v[i]; } for(int i=bl[a]+1;i<=bl[b]-1;i++) solve_sqrt(i); } int query(int a,int b) { int ans=0; for(int i=a;i<=min(bl[a]*blo,b);i++) ans+=v[i]; if(bl[a]!=bl[b]) for(int i=(bl[b]-1)*blo+1;i<=b;i++) ans+=v[i]; for(int i=bl[a]+1;i<=bl[b]-1;i++) ans+=sum[i]; return ans; } int main() { n=read();blo=sqrt(n); for(int i=1;i<=n;i++)v[i]=read(); for(int i=1;i<=n;i++) { bl[i]=(i-1)/blo+1; sum[bl[i]]+=v[i]; } for(int i=1;i<=n;i++) { int f=read(),a=read(),b=read(),c=read(); if(f==0)add(a,b,c); if(f==1) printf("%d\n",query(a,b)); } return 0; }